Property Persistence in the Situation Calculus

We develop an algorithm for reducing universally quantified situation calculus queries to a form more amenable to automated reasoning. Universal quantification in the situation calculus requires a second-order induction axiom, making automated reasoning difficult for such queries. We show how to reduce queries about property persistence, a common family of universally-quantified query, to an equivalent form that does not quantify over situations. The algorithm for doing so utilizes only first-order reasoning. We give several examples of important reasoning tasks that are facilitated by our approach, including checking for goal impossibility and reasoning about knowledge with partial observability of actions.

[1]  Lenhart K. Schubert,et al.  Discovering State Constraints in DISCOPLAN: Some New Results , 2000, AAAI/IAAI.

[2]  Eugenia Ternovska,et al.  A model checker for verifying ConGolog programs , 2002, AAAI/IAAI.

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

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

[5]  Leopoldo E. Bertossi,et al.  Automating Proofs of Integrity Constraints in Situation Calculus , 1996, ISMIS.

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

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

[8]  Dj Pym.  Journal of Logic and Computation: Editorial , 2005 .

[9]  Adrian R. Pearce,et al.  Knowledge and observations in the situation calculus , 2007, AAMAS '07.

[10]  Hector J. Levesque,et al.  Towards a logical theory of coordination and joint ability , 2007, AAMAS '07.

[11]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

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

[13]  Thomas Lukasiewicz,et al.  Team Programming in Golog under Partial Observability , 2007, IJCAI.

[14]  Hector J. Levesque,et al.  On the Progression of Situation Calculus Basic Action Theories: Resolving a 10-year-old Conjecture , 2008, AAAI.

[15]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

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

[17]  Hector J. Levesque,et al.  Foundations for the Situation Calculus , 1998, Electron. Trans. Artif. Intell..

[18]  Eugenia Ternovska,et al.  Automata Theory for Reasoning About Actions , 1999, IJCAI.

[19]  Alexander Ferrein,et al.  Using Golog for Deliberation and Team Coordination in Robotic Soccer , 2005, Künstliche Intell..

[20]  Maria Fox,et al.  The Automatic Inference of State Invariants in TIM , 1998, J. Artif. Intell. Res..

[21]  Francesco Savelli,et al.  Existential assertions and quantum levels on the tree of the situation calculus , 2006, Artif. Intell..

[22]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[23]  Raymond Reiter,et al.  The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression , 1991, Artificial and Mathematical Theory of Computation.

[24]  Fangzhen Lin,et al.  State Constraints Revisited , 1994, J. Log. Comput..

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

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

[27]  Andreas Herzig,et al.  Optimal Regression for Reasoning about Knowledge and Actions , 2007, AAAI.

[28]  Hector J. Levesque,et al.  What Robots Can Do: Robot Programs and Effective Achievability , 1998, Artif. Intell..

[29]  Vladimir Lifschitz,et al.  Artificial intelligence and mathematical theory of computation: papers in honor of John McCarthy , 1991 .

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

[31]  Raymond Reiter,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2001 .

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

[33]  P. Cousot,et al.  Constructive versions of tarski's fixed point theorems , 1979 .

[34]  Mayu Ishida,et al.  Reasoning about actions: a model-theoretic approach , 2006 .

[35]  Alex S. Taylor,et al.  Machine intelligence , 2009, CHI.

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

[37]  Raymond Reiter,et al.  Proving Properties of States in the Situation Calculus , 1993, Artif. Intell..

[38]  Johan van Benthem,et al.  The Tree of Knowledge in Action: Towards a Common Perspective , 2006, Advances in Modal Logic.

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