On the Semantics of Deliberation in IndiGolog — from Theory to Implementation

We develop an account of the kind of deliberation that an agent that is doing planning or executing high-level programs under incomplete information must be able to perform. The deliberator's job is to produce a kind of plan that does not itself require deliberation to interpret. We characterize these as epistemically feasible programs: programs for which the executing agent, at every stage of execution, by virtue of what it knew initially and the subsequent readings of its sensors, always knows what step to take next towards the goal of completing the entire program. We formalize this notion and characterize deliberation in the situation calculus based IndiGolog agent programming language in terms of it. We also show that for certain classes of problems, which correspond to those with bounded solutions and those with solutions without sensing, the search for epistemically feasible programs can be limited to programs of a simple syntactic form. Finally, we discuss implementation issues and execution monitoring and replanning too.

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

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

[3]  Robert D. Tennent,et al.  Semantics of programming languages , 1991, Prentice Hall International Series in Computer Science.

[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]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

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

[7]  Michael Fisher,et al.  Towards a Semantics for Concurrent METATEM , 1993, Executable Modal and Temporal Logics.

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

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

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

[11]  A. S. Roa,et al.  AgentSpeak(L): BDI agents speak out in a logical computable language , 1996 .

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

[13]  Koen V. Hindriks,et al.  Formal Semantics for an Abstract Agent Programming Language , 1997, ATAL.

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

[15]  Giuseppe De Giacomo,et al.  Execution Monitoring of High-Level Robot Programs , 1998, KR.

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

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

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

[19]  Gerhard Lakemeyer,et al.  On sensing and off-line interpreting in GOLOG , 1999 .

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

[21]  H. Levesque,et al.  Legolog : Inexpensive Experiments in Cognitive Robotics , 2000 .

[22]  Hector J. Levesque,et al.  ConGolog, a concurrent programming language based on the situation calculus , 2000, Artif. Intell..

[23]  Hector J. Levesque,et al.  Ability and Knowing How in the Situation Calculus , 2000, Stud Logica.

[24]  Gerhard Lakemeyer,et al.  The logic of knowledge bases , 2000 .

[25]  Yves Lesprance,et al.  Integrating Planning into Reactive High-Level Robot Programs , 2000 .

[26]  Tran Cao Son,et al.  Adapting Golog for Programming the Semantic Web , 2001 .

[27]  Yves Lespérance,et al.  On the Epistemic Feasibility of Plans in Multiagent Systems Specifications , 2001, Log. J. IGPL.

[28]  Sebastian Sardiña,et al.  Local Conditional High-Level Robot Programs , 2001, LPAR.

[29]  Piergiorgio Bertoli,et al.  Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking , 2001, IJCAI.

[30]  Hector J. Levesque,et al.  Incremental execution of guarded theories , 2001, ACM Trans. Comput. Log..

[31]  Ray Reiter,et al.  On knowledge-based programming with sensing in the situation calculus , 2001, ACM Trans. Comput. Log..

[32]  Michael Thielscher,et al.  Inferring Implicit State Knowledge and Plans with Sensing Actions , 2001, KI/ÖGAI.

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

[34]  Michael Thielscher.  Programming of Reasoning and Planning Agents with FLUX , 2002, KR 2002.

[35]  Sebastian Sardiña,et al.  Rational action in agent programs with prioritized goals , 2003, AAMAS '03.

[36]  H. Levesque,et al.  On Deliberation under Incomplete Information and the Inadequacy of Entailment and Consistency-Based Formalizations , 2003 .

[37]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..