Ability and Knowing How in the Situation Calculus
Document Type
Article
Publication Date
1-1-2000
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. © 2000 Kluwer Academic Publishers.
Identifier
0001548182 (Scopus)
Publication Title
Studia Logica
External Full Text Location
https://doi.org/10.1023/A:1026761331498
e-ISSN
15728730
ISSN
00393215
First Page
165
Last Page
186
Issue
1
Volume
66
Fund Ref
Natural Sciences and Engineering Research Council of Canada
Recommended Citation
Lespérance, Yves; Levesque, Hector J.; Fangzhen, L. I.N.; and Scherl, Richard B., "Ability and Knowing How in the Situation Calculus" (2000). Faculty Publications. 15827.
https://digitalcommons.njit.edu/fac_pubs/15827
