Studia Logica

, Volume 66, Issue 1, pp 165–186

Ability and Knowing How in the Situation Calculus

  • Yves Lespérance
  • Hector J. Levesque
  • Fangzhen Lin
  • Richard B. Scherl
Article

DOI: 10.1023/A:1026761331498

Cite this article as:
Lespérance, Y., Levesque, H.J., Lin, F. et al. Studia Logica (2000) 66: 165. doi:10.1023/A:1026761331498

Abstract

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.

reasoning about knowledge and actionknowledge prerequisites of actions

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Yves Lespérance
    • 1
  • Hector J. Levesque
    • 2
  • Fangzhen Lin
    • 3
  • Richard B. Scherl
    • 4
  1. 1.Department of Computer ScienceYork UniversityTorontoCanada
  2. 2.Department of Computer ScienceUniversity of TorontoTorontoCanada
  3. 3.Department of Computer ScienceThe Hong Kong University of Science and TechnologyClear Water BayHong Kong
  4. 4.Department of Computer and Information ScienceNew Jersey Institute of TechnologyNewarkUSA