Studia Logica

, Volume 66, Issue 1, pp 165-186

First online:

Ability and Knowing How in the Situation Calculus

  • Yves LespéranceAffiliated withDepartment of Computer Science, York University
  • , Hector J. LevesqueAffiliated withDepartment of Computer Science, University of Toronto
  • , Fangzhen LinAffiliated withDepartment of Computer Science, The Hong Kong University of Science and Technology
  • , Richard B. ScherlAffiliated withDepartment of Computer and Information Science, New Jersey Institute of Technology

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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 action knowledge prerequisites of actions