Formalizing sensing actions A transition function based approach

Abstract In presence of incomplete information about the world we need to distinguish between the state of the world and the state of the agent's knowledge about the world. In such a case the agent may need to have at its disposal sensing actions that change its state of knowledge about the world and may need to construct more general plans consisting of sensing actions and conditional statements to achieve its goal. In this paper we first develop a high-level action description language that allows specification of sensing actions and their effects in its domain description and allows queries with conditional plans. We give provably correct translations of domain description in our language to axioms in first-order logic, and relate our formulation to several earlier formulations in the literature. We then analyze the state space of our formulation and develop several sound approximations that have much smaller state spaces. Finally we define regression of knowledge formulas over conditional plans.

[1]  Maria Gini,et al.  An empirical study of sensing and defaulting in planning , 1992 .

[2]  David Scott Warren,et al.  Efficient Top-Down Computation of Queries under the Well-Founded Semantics , 1995, J. Log. Program..

[3]  Esra Erdem,et al.  Applications of Logic Programming to Planning: Computational Experiments , 1999 .

[4]  Chitta Baral,et al.  Reasoning about sensing actions and its application to diagnostic problem solving , 2000 .

[5]  Hudson Turner,et al.  A Causal Theory of Ramifications and Qualifications , 1995, IJCAI.

[6]  Vladimir Lifschitz,et al.  Nested Abnormality Theories , 1995, Artif. Intell..

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

[8]  Victor W. Marek,et al.  The Relationship Between Stable, Supported, Default and Autoepistemic Semantics for General Logic Programs , 1992, Theor. Comput. Sci..

[9]  Robert P. Goldman,et al.  Expressive Planning and Explicit Knowledge , 1996, AIPS.

[10]  Kedar S. Namjoshi,et al.  A mathematical investigation of reasoning about actions , 1995 .

[11]  Vladik Kreinovich,et al.  Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.

[12]  José Júlio Alferes,et al.  Classical Negation in Logic Programs , 1990 .

[13]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[14]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[15]  Esra Erdem,et al.  Transformations of Logic Programs Related to Causality and Planning , 1999, LPNMR.

[16]  Michael Gelfond,et al.  Strong Introspection , 1991, AAAI.

[17]  Hector J. Levesque,et al.  Reasoning about Noisy Sensors in the Situation Calculus , 1995, IJCAI.

[18]  Bart Selman,et al.  Encoding Plans in Propositional Logic , 1996, KR.

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

[20]  Keith Golden,et al.  Planning and knowledge representation for softbots , 1997 .

[21]  Murray Shanahan,et al.  Narratives in the Situation Calculus , 1994, J. Log. Comput..

[22]  Murray Shanahan.  Solving the frame problem - a mathematical investigation of the common sense law of inertia , 1997 .

[23]  Jorge Lobo,et al.  Adding Knowledge to the Action Description Language A , 1997, AAAI/IAAI.

[24]  Keith Golden,et al.  Representing Sensing Actions: The Middle Ground Revisited , 1996, KR.

[25]  Chitta Baral,et al.  Representing Actions: Laws, Observations and Hypotheses , 1997, J. Log. Program..

[26]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[27]  Michael Gelfond,et al.  Representing Actions in Extended Logic Programming , 1992, JICSLP.

[28]  David E. Smith,et al.  Conformant Graphplan , 1998, AAAI/IAAI.

[29]  Daniel S. Weld.  An Introduction to Least Commitment Planning , 1994, AI Mag..

[30]  Michael Gelfond,et al.  Representing Action and Change by Logic Programs , 1993, J. Log. Program..

[31]  V. Lifschitz,et al.  Actions with Indirect Eeects (preliminary Report) , 1994 .

[32]  Fangzhen Lin,et al.  Concurrent Actions in the Situation Calculus , 1992, AAAI.

[33]  Tran Cao Son,et al.  Approximate Reasoning about Actions in Presence of Sensing and Incomplete Information , 1997, ILPS.

[34]  Oren Etzioni,et al.  An Approach to Planning with Incomplete Information , 1992, KR.

[35]  Enrico Giunchiglia,et al.  Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..

[36]  Robert C. Moore.  Reasoning About Knowledge and Action , 1977, IJCAI.

[37]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[38]  Chitta Baral,et al.  Representing Concurrent Actions in Extended Logic Programming , 1993, IJCAI.

[39]  Chitta Baral,et al.  Reasoning About Effects of Concurrent Actions , 1997, J. Log. Program..

[40]  Oren Etzioni,et al.  Planning with Execution and Incomplete Information , 1996 .

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

[42]  David S. Warren,et al.  Representing actions in logic programming and its applications in database updates , 1993 .

[43]  Chitta Baral,et al.  Reasoning about actions: Non-deterministic effects, Constraints, and Qualification , 1995, IJCAI.

[44]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[45]  Hector J. Levesque,et al.  What Is Planning in the Presence of Sensing? , 1996, AAAI/IAAI, Vol. 2.

[46]  Edwin P. D. Pednault,et al.  ADL and the State-Transition Model of Action , 1994, J. Log. Comput..

[47]  Fangzhen Lin,et al.  Embracing Causality in Specifying the Indirect Effects of Actions , 1995, IJCAI.

[48]  Maurice Bruynooghe,et al.  Temporal Reasoning with Abductive Event Calculus , 1992, ECAI.

[49]  Robert C. Moore,et al.  Formal Theories of the Commonsense World , 1985 .

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

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

[52]  Bernhard Nebel,et al.  Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.

[53]  David E. Smith,et al.  Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.

[54]  Hudson Turner,et al.  Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach , 1997, J. Log. Program..

[55]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[56]  Gregg Collins,et al.  2Planning for Contingencies: A Decision-based Approach , 1996, J. Artif. Intell. Res..

[57]  G. Neelakantan Kartha,et al.  Soundness and Completeness Theorems for Three Formalizations of Action , 1993, IJCAI.

[58]  Andrew R. Haas,et al.  A Syntactic Theory of Belief and Action , 1986, Artif. Intell..

[59]  Vladimir Lifschitz,et al.  Actions with Indirect Effects (Preliminary Report) , 1994, KR.

[60]  Chitta Baral,et al.  Reasoning about Eeects of Concurrent Actions , 1996 .

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

[62]  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.

[63]  Hudson Turner,et al.  Signed Logic Programs , 1994, ILPS.

[64]  Alfredo Gabaldon,et al.  Formalizing Narratives Using Nested Circumscription , 1996, Artif. Intell..