A Model-Theoretic Approach to the Verification of Situated Reasoning Systems

The study of situated systems that are capable of reactive and goal-directed behaviour has received increased attention in recent years. One approach to the design of such systems is based upon agent-oriented architectures. This approach has led to the development of expressive, but computationally intractable, logics for describing or specifying the behaviours of agent-oriented systems. In this paper, we present three propositional variants of such logics, with different expressive power, and analyze the computational complexity of verifying if a given property is satisfied by a given abstract agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the practical use of such logics for verifying agent-oriented systems.

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

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

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

[4]  Michael P. Georgeff,et al.  Commitment and Effectiveness of Situated Agents , 1991, IJCAI.

[5]  Anand S. Rao,et al.  An Abstract Architecture for Rational Agents , 1992, KR.

[6]  Leslie Pack Kaelbling,et al.  The Synthesis of Digital Machines With Provable Epistemic Properties , 1986, TARK.

[7]  M.P. Georgeff,et al.  Procedural knowledge , 1986, Proceedings of the IEEE.

[8]  David J. Israel,et al.  Plans and resource‐bounded practical reasoning , 1988, Comput. Intell..

[9]  Michael P. Georgeff,et al.  A Model-Theoretic Approach to the Verification of Agent-Oriented Systems , 1993 .

[10]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[11]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[12]  Munindar P. Singh.  A Logic of Situated Know-How , 1991, AAAI.

[13]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[14]  Joseph Y. Halpern,et al.  Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.

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

[16]  Yoav Shoham,et al.  AGENT0: A Simple Agent Language and Its Interpreter , 1991, AAAI.

[17]  Anand S. Rao,et al.  Asymmetry Thesis and Side-Effect Problems in Linear-Time and Branching-Time Intention Logics , 1991, IJCAI.