Ability and Knowing How in the Situation Calculus

Most agents can acquire information about their environments as they operate. A good plan for such an agent is one that not only achieves the goal, but is also executable, i.e., ensures that the agent has enough information at every step to know what to do next. In this paper, we present a formal account of what it means for an agent to know how to execute a plan and to be able to achieve a goal. Such a theory is a prerequisite for producing specifications of planners for agents that can acquire information at run time. It is also essential to account for cooperation among agents. Our account is more general than previous proposals, correctly handles programs containing loops, and incorporates a solution to the frame problem. It can also be used to prove programs containing sensing actions correct.

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

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

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

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

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

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

[7]  A. Haas.  The Case for Domain-Specific Frame Axioms , 1987 .

[8]  Lenhart K. Schubert.  Monotonic Solution of the Frame Problem in the Situation Calculus: An Efficient Method for Worlds wi , 1990 .

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

[10]  Henry E. Kyburg,et al.  Knowledge Representation and Defeasible Reasoning , 1990 .

[11]  Gerhard Weiss,et al.  Multiagent Systems , 1999 .

[12]  Marcel Schoppers,et al.  Building plans to monitor and exploit open-loop and closed-loop dynamics , 1992 .

[13]  Leora Morgenstern,et al.  Knowledge Preconditions for Actions and Plans , 1988, IJCAI.

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

[15]  David Chapman,et al.  What are plans for? , 1990, Robotics Auton. Syst..

[16]  Ernest Davis,et al.  Knowledge Preconditions for Plans , 1993, J. Log. Comput..

[17]  Gerhard Lakemeyer,et al.  AOL: A logic of Acting, Sensing, Knowing, and Only Knowing , 1998, KR.

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

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

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

[21]  John-Jules Ch. Meyer,et al.  A Logic of Capabilities , 1994, LFCS.

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

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

[24]  Daniel Marcu,et al.  A Logical Approach to High-Level Robot Programming A Progress Report* , 1994 .

[25]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.