Progression and Verification of Situation Calculus Agents with Bounded Beliefs

We investigate agents that have incomplete information and make decisions based on their beliefs expressed as situation calculus bounded action theories. Such theories have an infinite object domain, but the number of objects that belong to fluents at each time point is bounded by a given constant. Recently, it has been shown that verifying temporal properties over such theories is decidable. We take a first-person view and use the theory to capture what the agent believes about the domain of interest and the actions affecting it. In this paper, we study verification of temporal properties over online executions. These are executions resulting from agents performing only actions that are feasible according to their beliefs. To do so, we first examine progression, which captures belief state update resulting from actions in the situation calculus. We show that, for bounded action theories, progression, and hence belief states, can always be represented as a bounded first-order logic theory. Then, based on this result, we prove decidability of temporal verification over online executions for bounded action theories.

[1]  Gerhard Lakemeyer,et al.  First-Order Strong Progression for Local-Effect Basic Action Theories , 2008, KR.

[2]  Giuseppe De Giacomo,et al.  Composition of ConGolog programs , 2009, IJCAI 2009.

[3]  Rafael H. Bordini,et al.  Model checking agent programming languages , 2012, Automated Software Engineering.

[4]  Neil Immerman,et al.  Descriptive complexity and finite models : proceedings of a DIMACS workshop, January 14-17, 1996, Princeton University , 1997 .

[5]  Hector J. Levesque,et al.  Projection Using Regression and Sensors , 1999, IJCAI.

[6]  Hector J. Levesque,et al.  The Cognitive Agents Specification Language and Verification Environment , 2010 .

[7]  Hector J. Levesque,et al.  The cognitive agents specification language and verification environment for multiagent systems , 2002, AAMAS '02.

[8]  Giuseppe De Giacomo,et al.  Bounded Epistemic Situation Calculus Theories , 2013, IJCAI.

[9]  E. Allen Emerson,et al.  Model Checking and the Mu-calculus , 1996, Descriptive Complexity and Finite Models.

[10]  M. B. van Riemsdijk,et al.  Using the Maude Term Rewriting Language for Agent Development with Formal Foundations , 2010 .

[11]  Alin Deutsch,et al.  Automatic verification of data-centric business processes , 2009, ICDT '09.

[12]  Mikhail Soutchanski,et al.  Decidable Reasoning in a Modified Situation Calculus , 2007, IJCAI.

[13]  Christel Baier,et al.  Principles of model checking , 2008 .

[14]  Giuseppe De Giacomo,et al.  Situation Calculus Based Programs for Representing and Reasoning about Game Structures , 2010, KR.

[15]  Jianwen Su,et al.  Specification and Verification of Artifact Behaviors in Business Process Models , 2007, ICSOC.

[16]  De GiacomoGiuseppe,et al.  Progression and Verification of Situation Calculus Agents with Bounded Beliefs , 2016 .

[17]  Giuseppe De Giacomo,et al.  Bounded Situation Calculus Action Theories and Decidable Verification , 2012, KR.

[18]  Leonid Libkin,et al.  Embedded Finite Models and Constraint Databases , 2007 .

[19]  Alessio Lomuscio,et al.  Verification of Agent-Based Artifact Systems , 2013, J. Artif. Intell. Res..

[20]  Giuseppe De Giacomo,et al.  LTL Verification of Online Executions with Sensing in Bounded Situation Calculus , 2014, ECAI.

[21]  Richard Hull,et al.  Artifact-Centric Business Process Models: Brief Survey of Research Results and Challenges , 2008, OTM Conferences.

[22]  Hector J. Levesque,et al.  How to progress a database III , 2013, Artif. Intell..

[23]  Fangzhen Lin,et al.  How to Progress a Database , 1997, Artif. Intell..

[24]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[25]  Alessio Lomuscio,et al.  MCMAS: A Model Checker for the Verification of Multi-Agent Systems , 2009, CAV.

[26]  Sebastian Sardiña,et al.  Reasoning about Agent Programs using ATL-like Logics , 2012, JELIA.

[27]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

[28]  Hector J. Levesque,et al.  IndiGolog: A High-Level Programming Language for Embedded Reasoning Agents , 2009, Multi-Agent Programming, Languages, Tools and Applications.

[29]  Gerhard Lakemeyer,et al.  Semantics for a useful fragment of the situation calculus , 2005, IJCAI.

[30]  Wil M. P. van der Aalst,et al.  Process Aware Information Systems: Bridging People and Software Through Process Technology , 2005 .

[31]  Gerhard Lakemeyer,et al.  A Logic for Non-Terminating Golog Programs , 2008, KR.

[32]  Faron Moller,et al.  Verification on Infinite Structures , 2001, Handbook of Process Algebra.

[33]  Stavros Vassos,et al.  A Classification of First-Order Progressable Action Theories in Situation Calculus , 2013, IJCAI.

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

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

[36]  Hector J. Levesque,et al.  On the Semantics of Deliberation in IndiGolog — from Theory to Implementation , 2002, Annals of Mathematics and Artificial Intelligence.

[37]  Eugenia Ternovskaia,et al.  Automata theory for reasoning about actions , 1999, IJCAI 1999.

[38]  Raymond Reiter,et al.  Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter , 2001 .

[39]  Diego Calvanese,et al.  Verification of relational data-centric dynamic systems with external services , 2012, PODS.

[40]  Blai Bonet,et al.  Conformant plans and beyond: Principles and complexity , 2010, Artif. Intell..

[41]  Raymond Reiter,et al.  Some contributions to the metatheory of the situation calculus , 1999, JACM.

[42]  Gerhard Lakemeyer,et al.  Situations, Si! Situation Terms, No! , 2004, KR.

[43]  Michael Wooldridge,et al.  On the Formal Specification and Verification of Multi-Agent Systems , 1997, Int. J. Cooperative Inf. Syst..

[44]  Christel Baier,et al.  Principles of Model Checking (Representation and Mind Series) , 2008 .

[45]  Colin Stirling,et al.  Modal and Temporal Properties of Processes , 2001, Texts in Computer Science.

[46]  Hector J. Levesque,et al.  The Frame Problem and Knowledge-Producing Actions , 1993, AAAI.

[47]  Gerhard Lakemeyer,et al.  Only-Knowing: Taking It Beyond Autoepistemic Reasoning , 2005, AAAI.

[48]  Gerhard Lakemeyer,et al.  Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs , 2014, AAAI.

[49]  Diego Calvanese,et al.  Foundations of Relational Artifacts Verification , 2011, BPM.

[50]  Hector J. Levesque,et al.  Tractable Reasoning with Incomplete First-Order Knowledge in Dynamic Systems with Context-Dependent Actions , 2005, IJCAI.

[51]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[52]  Hector J. Levesque,et al.  An Incremental Interpreter for High-Level Programs with Sensing , 1999 .

[53]  Hector J. Levesque,et al.  Knowledge, action, and the frame problem , 2003, Artif. Intell..

[54]  Hector J. Levesque,et al.  On ability to autonomously execute agent programs with sensing , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[55]  Hector J. Levesque,et al.  On the Limits of Planning over Belief States under Strict Uncertainty , 2006, KR.

[56]  Gerhard Lakemeyer,et al.  Point-based value iteration: an anytime algorithm for POMDPs , 2003, IJCAI 2003.

[57]  Robert C. Moore.  A Formal Theory of Knowledge and Action , 1984 .

[58]  Alex M. Andrew,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2002 .