Recurring dominoes: making the highly undecidable highly understandable
Selected papers of the international conference on "foundations of computation theory" on Topics in the theory of computation
Intention is choice with commitment
Artificial Intelligence
Handbook of theoretical computer science (vol. B)
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Issues in Agent-Based Software Engineeing
CIA '97 Proceedings of the First International Workshop on Cooperative Information Agents
Semantical consideration on floyo-hoare logic
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
A model-theoretic approach to the verification of situated reasoning systems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
BDI Models and Systems: Bridging the Gap
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
A Model Checking Algorithm for Multiagent Systems
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
The Belief-Desire-Intention Model of Agency
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
A Classification Schema to Volumes 1 to 5 of the Intelligent Agents Series
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
Intention Reconsideration Reconsidered
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
Information-Passing and Belief Revision in Multi-Agent Systems
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
Agent Communication Language: Toward a Semantics Based on Success, Satisfaction, and Recursion
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
The behavior of an agent is mainly governed by the specific way it handles the rational balance between information and deliberation. Most popular among the formalisms capturing this very balance is Rao and Georgeff's BDI theory. This formalism has been proposed as a language for specifying agents in an abstract manner or, alternatively, for verifying various properties of agents implemented in some other programming language. In mainstream Computer Science, there are formalisms designed for a similar purpose as the BDI theory, though not specifically aiming at agents, but at concurrency in general. These formalisms are known as logics of concurrent programs. In this paper, these two frameworks are for the first time compared with each other. The result shows that the basic BDI theory, BDICTL*, can be captured within a standard logic of concurrency. The logic relevant here is Kozen's propositional µ-calculus. The µ-calculus turns out to be even strictly stronger in expressive power than BDICTL* , while enjoying a computational complexity which is not higher than that of BDICTL* 's small fragment CTL. This correspondence brings us in a position to give the first complete axiomatization of Rao and Georgeff's full theory.