The complexity of reasoning about knowledge and time. I. lower bounds
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Reasoning about knowledge
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Communicating sequential processes
Communications of the ACM
Verifiable Semantics for Agent Communication Languages
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Semantic Issues in the Verification of Agent Communication Languages
Autonomous Agents and Multi-Agent Systems
Semantics of Agent Communication: An Introduction
Selected papers from the UKMAS Workshop on Foundations and Applications of Multi-Agent Systems
A Logical Framework for Knowledge Sharing in Multi-agent Systems
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Quantified epistemic logics for reasoning about knowledge in multi-agent systems
Artificial Intelligence
Enumerating the preconditions of agent message types
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
In recent years, a number of attempts have been made to develop standardized agent communication languages. A key issue in such languages is that of conformance testing. That is, given a program which claims to semantically conform to some agent communication standard, how can we determine whether or not it does indeed conform to it? In this article, we present an expressive agent communication language, and give a semantics for this language in such a way that verifying semantic conformance becomes a realistic possibility. The techniques we develop draw upon those used to give a semantics to reactive systems in theoretical computer science. To illustrate the approach, we give an example of a simple agent system, and show that it does indeed respect the semantics.