Observation-based Model for BDI-Agents

We present a new computational model of BDI-agents, called the observation-based BDI-model. The key point of this BDI-model is to express agents' beliefs, desires and intentions as a set of runs (computing paths), which is exactly a system in the interpreted system model, a well-known agent model due to Halpern and his colleagues. Our BDI-model is computationally grounded in that we are able to associate the BDI-agent model with a computer program, and formulas, involving agents' beliefs, desires (goals) and intentions, can be understood as properties of program computations. We present a sound and complete proof system with respect to our BDI-model and explore how symbolic model checking techniques can be applied to model checking BDI-agents. In order to make our BDI-model more flexible and practically realistic, we generalize it so that agents can have multiple sources of beliefs, goals and intentions.

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

[2]  F. S. deBoer.  Agent Programming in 3APL , 1999 .

[3]  Alessandro Cimatti,et al.  Symbolic Model Checking for Multi-Agent Systems , 2007 .

[4]  Michael Wooldridge,et al.  Model Checking Knowledge and Time , 2002, SPIN.

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

[6]  Anand S. Rao,et al.  Decision Procedures for BDI Logics , 1998, J. Log. Comput..

[7]  Yoav Shoham,et al.  Agent-Oriented Programming , 1992, Artif. Intell..

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

[9]  Kaile Su,et al.  Model Checking Temporal Logics of Knowledge in Distributed Systems , 2004, AAAI.

[10]  Michael Wooldridge,et al.  Tractable multiagent planning for epistemic goals , 2002, AAMAS '02.

[11]  Kaile Su,et al.  Symbolic model checking the knowledge of the dining cryptographers , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..

[12]  Koen V. Hindriks,et al.  Agent Programming in 3APL , 1999, Autonomous Agents and Multi-Agent Systems.

[13]  Michael Wooldridge,et al.  Computationally grounded theories of agency , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[14]  Anand S. Rao,et al.  AgentSpeak(L): BDI Agents Speak Out in a Logical Computable Language , 1996, MAAMAW.

[15]  Michael Wooldridge,et al.  Model checking agentspeak , 2003, AAMAS '03.

[16]  Michael Wooldridge,et al.  A Computationally Grounded Logic of Visibility, Perception, and Knowledge , 2001, Log. J. IGPL.

[17]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[18]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 2002, JACM.

[19]  Alessio Lomuscio,et al.  Verification of multiagent systems via ordered binary decision diagrams: an algorithm and its implementation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[20]  Klaus Schild.  On the Relationship Between BDI Logics and Standard Logics of Concurrency , 1998, ATAL.

[21]  Michael Wooldridge,et al.  Towards a Logic of Rational Agency , 2003, Log. J. IGPL.

[22]  Joseph Y. Halpern,et al.  A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols , 1992, JACM.

[23]  Joseph Y. Halpern,et al.  Complete Axiomatizations for Reasoning about Knowledge and Time , 2002, SIAM J. Comput..

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