Proof Systems for Planning Under Cautious Semantics

Minds and Machines 23 (1):5-45 (2013)
  Copy   BIBTEX

Abstract

Planning with incomplete knowledge becomes a very active research area since late 1990s. Many logical formalisms introduce sensing actions and conditional plans to address the problem. The action language $\mathcal{A}_{K}$ invented by Son and Baral is a well-known framework for this purpose. In this paper, we propose so-called cautious and weakly cautious semantics for $\mathcal{A}_{K}$ , in order to allow an agent to generate and execute reliable plans in safety-critical environments. Intuitively speaking, cautious and weakly cautious semantics enable the agent to know exactly what happens after the execution of an action. Computational complexity analysis shows that cautious semantics reduces the reasoning complexity of $\mathcal{A}_{K}$ , it is also worth to point out that many useful domains could still be expressed with this setting. Another important contribution of our work is the development of Hoare style proof systems. These proof systems are served as inference mechanisms for the verification of conditional plans, and proved to be sound and complete. In addition, they could also be used for plan generation, in the sense that constructing a derivation is indeed a procedure to finding a plan. We point out that the proof systems posses a nice property for off-line planning, that is, the agent could generate and store short proofs in her spare time, and perform quick plan query by easily constructing a long proof from the stored shorter ones (under the assumption that sufficient proofs are stored)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Action planning supplements mirror systems in language evolution.Bruce Bridgeman - 2005 - Behavioral and Brain Sciences 28 (2):129-130.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
Labelled non-classical logics.Luca Viganò - 2000 - Boston: Kluwer Academic Publishers.
Reasoning About Truth in First-Order Logic.Claes Strannegård, Fredrik Engström, Abdul Rahim Nizamani & Lance Rips - 2013 - Journal of Logic, Language and Information 22 (1):115-137.
Plans, affordances, and combinatory grammar.Mark Steedman - 2002 - Linguistics and Philosophy 25 (5-6):723-753.
Some multi-conclusion modal paralogics.Casey McGinnis - 2007 - Logica Universalis 1 (2):335-353.
Introduction to mathematical logic.Michał Walicki - 2012 - Hackensack, NJ: World Scientific.

Analytics

Added to PP
2012-11-23

Downloads
62 (#254,871)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?