Logics of time and computation
Logics of time and computation
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Semantic Issues in the Verification of Agent Communication Languages
Autonomous Agents and Multi-Agent Systems
Commitment-Based Policies in Persuasion Dialogues with Defeasible Beliefs
Agent Communication II
A unification-based approach to configure generic protocols into agent interaction models
International Journal of Agent-Oriented Software Engineering
Using constraints and process algebra for specification of first-class agent interaction protocols
ESAW'06 Proceedings of the 7th international conference on Engineering societies in the agents world VII
Joint conversation specification and compliance
DALT'07 Proceedings of the 5th international conference on Declarative agent languages and technologies V
A modeling framework for generic agent interaction protocols
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
Hi-index | 0.00 |
Although informative, the semantic definition proposed for the most standard agent communication language (FIPA ACL 1997) is complicated and contentious, while published interaction protocols (IPs) tend to be ambiguous, incomplete, and unverified with respect to message semantics. To clarify and help rectify these problems, this paper proposes an integrated framework based on Propositional Dynamic Logic and Belief and Intention modalities (called the PDL-BI language). Specifically, we provide an axiomatisation of PDL-BI and for an agent's propositional attitudes (beliefs and intentions) and social attitudes (such as sincerity and trustworthiness). Then we suggest a revised and simpler core semantics for many of the FIPA ACL speech acts, which, in turn, lead to the specification of the semantics of IPs. As a case study, we specify the semantics of the contract net protocol (CNP) in PDL-BI, which allows to prove that the CNP terminates.