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

  • Authors:

  • Sebastian Sardina;Giuseppe De Giacomo;Yves Lespérance;Hector J. Levesque

  • Affiliations:

  • Department of Computer Science, University of Toronto, Toronto, ON, M5S 3G4, Canada e-mail: ssardina@ai.toronto.edu;Dip. Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, 00198 Roma, Italy e-mail: degiacomo@dis.uniroma1.it;Department of Computer Science, York University, Toronto, ON, M3J 1P3, Canada e-mail: lesperan@cs.yorku.ca;Department of Computer Science, University of Toronto, Toronto, ON, M5S 3G4, Canada e-mail: hector@ai.toronto.edu

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.