Ability and Knowing How in the Situation Calculus

Ability and Knowing How in the Situation Calculus (1995)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Yves Lesperance , Hector J. Levesque , Fangzhen Lin , Richard B. Scherl

Venue:	Studia Logica
Citations:	24 - 13 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Ability and Knowing How in the Situation Calculus	user correction - Legacy Corrections
AUTHOR NAME	Yves Lesperance	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, York University, Toronto, ON, M3J 1P3 Canada	SVM HeaderParse 0.2
AUTHOR NAME	Hector J. Levesque	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, University of Toronto	SVM HeaderParse 0.2
AUTHOR ADDR	Toronto, ON, M5S 1A4; Canada	SVM HeaderParse 0.1
AUTHOR NAME	Fangzhen Lin	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, The Hong Kong University of Science and	SVM HeaderParse 0.2
AUTHOR ADDR	Technology, Clear Water Bay, Hong Kong	SVM HeaderParse 0.1
AUTHOR NAME	Richard B. Scherl	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer and Information Science, New Jersey Institute of; Technology, University Heights, Newark	SVM HeaderParse 0.2
AUTHOR ADDR	NJ 07102 USA	SVM HeaderParse 0.1
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 agenttoknow 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.	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
VENUE	Studia Logica	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	2000	INFERENCE
VOLUME	66	INFERENCE
CITATIONS	25 found	ParsCit 1.0