Ability and knowing how in the situation calculus

Studia Logica 66 (1):165-186 (2000)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
79 (#191,748)

6 months
3 (#439,386)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Knowledge, action, and the frame problem.Richard B. Scherl & Hector J. Levesque - 2003 - Artificial Intelligence 144 (1-2):1-39.
Resolving distributed knowledge.Thomas Ågotnes & Yì N. Wáng - 2017 - Artificial Intelligence 252 (C):1-21.
Analyzing generalized planning under nondeterminism.Vaishak Belle - 2022 - Artificial Intelligence 307 (C):103696.
A Modal Loosely Guarded Fragment of Second-Order Propositional Modal Logic.Gennady Shtakser - 2023 - Journal of Logic, Language and Information 32 (3):511-538.

View all 9 citations / Add more citations