David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 66 (1):165-186 (2000)
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)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Eric Pacuit & Sunil Simon (2011). Reasoning with Protocols Under Imperfect Information. Review of Symbolic Logic 4 (3):412-444.
Similar books and articles
Timothy Williamson (2006). Can Cognition Be Factorized Into Internal and External Components? In Robert J. Stainton (ed.), Contemporary Debates in Cognitive Science. Malden MA: Blackwell Publishing.
B. van Linder, W. van der Hoek & J.-J. Ch Meyer (1997). Seeing is Believing. Journal of Logic, Language and Information 6 (1):33-61.
Thomas Ågotnes & Dirk Walther (2009). A Logic of Strategic Ability Under Bounded Memory. Journal of Logic, Language and Information 18 (1):55-77.
Riccardo Rosati (2001). A Sound and Complete Tableau Calculus for Reasoning About Only Knowing and Knowing at Most. Studia Logica 69 (1):171-191.
H. Nakashima (1999). AI as Complex Information Processing. Minds and Machines 9 (1):57-80.
Lucas Dixon, Alan Smaill & Tracy Tsang (2009). Plans, Actions and Dialogues Using Linear Logic. Journal of Logic, Language and Information 18 (2):251-289.
Gerhard Lakemeyer (2010). The Situation Calculus: A Case for Modal Logic. [REVIEW] Journal of Logic, Language and Information 19 (4):431-450.
Added to index2009-01-28
Total downloads8 ( #192,196 of 1,410,123 )
Recent downloads (6 months)2 ( #107,970 of 1,410,123 )
How can I increase my downloads?