The Evolving Role of Constraints in the Functional Data Model
Journal of Intelligent Information Systems - Special issue on functional approach to intelligent information systems
Supervised interaction: creating a web of trust for contracting agents in electronic environments
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Autonomous Agents and Multi-Agent Systems
A semantic web approach to handling soft constraints in virtual organisations
ICEC '06 Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet
A reusable commitment management service using Semantic Web technology
Knowledge-Based Systems
Agent-based virtual organisations for the Grid
Multiagent and Grid Systems - Smart Grid Technologies & Market Models
A Semantic web approach to handling soft constraints in virtual organisations
Electronic Commerce Research and Applications
| Hi-index | 0.00 |
In a virtual organisation (VO), a group of cooperating agents may offer resources (or services) consisting of all, or part, of the sum of their individual contributions. Some of these resources may already be in use for certain time periods (existing commitments), and these existing commitments may vary in value to the VO. Using constraint reification and cumulative scheduling methods, we investigate ways in which agents may manage their resources and existing commitments when faced with a decision to take on new commitments. We describe a technique that allows an agent to intelligently construct satisfiable permutations consisting of existing and new commitments, and use preference and quality information to choose between these permutations. We show how constraint reification is used to model whether commitments are breakable/re-negotiable and how this influences the permutations available to the agents.