On the Relationship Between BDI Logics and Standard Logics of Concurrency

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.

[1]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[2]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[3]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[4]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[5]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[6]  R. A. Bull,et al.  Basic Modal Logic , 1984 .

[7]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[8]  Laurent Catach.  Normal Multimodal Logics , 1988, AAAI.

[9]  Robert S. Streett.  Fixpoints and Program Looping: Reductions form the Propositional MU-Calculus into Propositional Dynamic Logics of Looping , 1985, Logic of Programs.

[10]  D. Harel.  Recurring dominoes: making the highly undecidable highly understandable , 1985 .

[11]  Vaughan R. Pratt,et al.  Semantical consideration on floyo-hoare logic , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[12]  Michael Wooldridge,et al.  Agent-based software engineering , 1997, IEE Proc. Softw. Eng..

[13]  Anand S. Rao,et al.  Modeling Rational Agents within a BDI-Architecture , 1997, KR.

[14]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[15]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[16]  Hector J. Levesque,et al.  Intention is Choice with Commitment , 1990, Artif. Intell..

[17]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

[18]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[19]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[20]  Anand S. Rao,et al.  A Model-Theoretic Approach to the Verification of Situated Reasoning Systems , 1993, IJCAI.

[21]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[22]  Igor Walukiewicz.  On completeness of the mu -calculus , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[23]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[24]  A. Prasad Sistla,et al.  On Model-Checking for Fragments of µ-Calculus , 1993, CAV.

[25]  Michael Wooldridge,et al.  Issues in Agent-Based Software Engineering , 1997, CIA.