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
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Intention is choice with commitment
Artificial Intelligence
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Reasoning about knowledge
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Propositional Dynamic Logic of looping and converse
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An Extension of BDICTL with Functional Dependencies and Components
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Resolving Conflicts between Beliefs, Obligations, Intentions, and Desires
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Specifying the Merging of Desires into Goals in the Context of Beliefs
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
A grounded specification language for agent programs
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Knowledge and Strategic Ability for Model Checking: A Refined Approach
MATES '08 Proceedings of the 6th German conference on Multiagent System Technologies
Formal Modelling of Emotions in BDI Agents
Computational Logic in Multi-Agent Systems
Issues in Designing Logical Models for Norm Change
Organized Adaption in Multi-Agent Systems
Observation-based model for BDI-agents
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
A modal logic for beliefs and pro attitudes
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
BDIO: obligations and the specification of agent behavior
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Modal structure for agents interaction based on concurrent actions
CEEMAS'03 Proceedings of the 3rd Central and Eastern European conference on Multi-agent systems
Group intention is social choice with commitment
COIN@AAMAS'10 Proceedings of the 6th international conference on Coordination, organizations, institutions, and norms in agent systems
Observation-Based logic of knowledge, belief, desire and intention
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
| Hi-index | 0.00 |
The behavior of an agent is mainly governed by the specific way in which it handles the rational balance between information and deliberation. Rao and Georgeff's BDI theory is most popular among the formalisms capturing this very balance. 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 purpose similar to the BDI theory; 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 compared with each other for the first time. The result shows that the basic BDI theory, BDI_CTL*, can be captured within a standard logic of concurrency. The logic which is relevant here is Kozen's propositional μ-calculus. μ-calculus turns out to be even strictly stronger in expressive power than BDI_CTL* while enjoying a computational complexity which is not higher than that of BD_CTL*'s small fragment CTL. This correspondence puts us in a position to provide the first axiomatization of Rao and Georgeff's full theory. Immediate consequences for the computational complexity of BDI theory are also explored, both for theorem proving and model checking.