Ability and knowing how in the situation calculus

Studia Logica 66 (1):165-186 (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.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1026761331498
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,300
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Reasoning with Protocols Under Imperfect Information.Eric Pacuit & Sunil Simon - 2011 - Review of Symbolic Logic 4 (3):412-444.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
27 ( #194,455 of 2,193,098 )

Recent downloads (6 months)
2 ( #145,544 of 2,193,098 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature