First-Order Strong Progression for Local-Effect Basic Action Theories

In a seminal paper Lin and Reiter introduced the notion of progression for basic action theories in the situation calculus. The idea is to replace an initial database by a new set of sentences which reflect the changes due to an action. Unfortunately, progression requires second-order logic in general. In this paper, we introduce the notion of strong progression, a slight variant of Lin and Reiter that has the intended properties, and we show that in case actions have only local effects, progression is always first-order representable. Moreover, for a restricted class of local-effect axioms we show how to construct a new database that is finite.

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

[2]  John G. Gibbons.  Knowledge in Action , 2001 .

[3]  Eyal Amir,et al.  First-Order Logical Filtering , 2005, IJCAI.

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

[5]  W. Ackermann.  Untersuchungen über das Eliminationsproblem der mathematischen Logik , 1935 .

[6]  Michael Thielscher,et al.  From Situation Calculus to Fluent Calculus: State Update Axioms as a Solution to the Inferential Frame Problem , 1999, Artif. Intell..

[7]  Hector J. Levesque,et al.  Progression of Situation Calculus Action Theories with Incomplete Information , 2007, IJCAI.

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

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

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

[11]  Andrzej Szałas,et al.  ELIMINATION OF PREDICATE QUANTIFIERS , 1999 .

[12]  Uwe Reyle,et al.  Logic, Language and Reasoning , 1999 .

[13]  Gerhard Lakemeyer,et al.  Towards an Integration of Golog and Planning , 2007, IJCAI.

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

[15]  Fangzhen Lin.  Discovering State Invariants , 2004, KR.

[16]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

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

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

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

[20]  Patrick Doherty,et al.  Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas , 2001, IJCAI.