Flexible protocol specification and execution: applying event calculus planning using commitments
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
WWW '03 Proceedings of the 12th international conference on World Wide Web
Defining interaction protocols using a commitment-based agent communication language
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
The cognitive coherence approach for agent communication pragmatics
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Distributed enactment of multiagent workflows: temporal logic for web service composition
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Interaction Protocols as Design Abstractions for Business Processes
IEEE Transactions on Software Engineering
A semantic approach for designing commitment protocols
AC'04 Proceedings of the 2004 international conference on Agent Communication
DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies
Behavior-Oriented Commitment-based Protocols
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Commitment-based protocols with behavioral rules and correctness properties of MAS
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Constitutive and regulative specifications of commitment protocols: A decoupled approach
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on agent communication, trust in multiagent systems, intelligent tutoring and coaching systems
| Hi-index | 0.00 |
Commitment protocols enable flexibility in agent interactions by utilizing the semantics of commitments to develop succinct declarative specifications for protocols that allow a large number of executions. As a consequence, commitment protocols enable agents to accommodate varying local policies and respond to exceptions. A consequent weakness of such protocols is that commitment protocols thus fail to distinguish between possible executions that are normal and those that may be allowed but are not ideal. This paper develops an approach for specifying preferencesamong executions that are allowed by a protocol. It captures sets of executions via a simple language and gives them a denotational characterization based on branching-time models. It shows how to incorporate the specifications into rulesets, thereby giving the specifications a natural operational characterization. The rulesets embed into a recent practical framework for protocols called OWL-P. The paper shows that the operational and denotational characterizations coincide.