A New Logical Framework for Deductive Planning
Abstract
In this paper we present a logical framework for defining consistent axiomatizations of planning domains. A language to define basic actions and structured plans is embedded in a logic. This allows general properties of a whole planning scenario to be proved as well as plans to be formed deductively. In particular, frame assertions and domain constraints as invariants of the basic actions can be formulated and proved. Even for complex plans most frame assertions are obtained by purely syntactic analysis. In such cases the formal proof can be generated in a uniform way. The formalism we introduce is especially useful when treating recursive plans.\nA tactical theorem prover, the Karlsruhe Interactive Verifier KIV is used to implement this logical framework.
Cite
Text
Stephan and Biundo. "A New Logical Framework for Deductive Planning." International Joint Conference on Artificial Intelligence, 1993. doi:10.22028/D291-24866Markdown
[Stephan and Biundo. "A New Logical Framework for Deductive Planning." International Joint Conference on Artificial Intelligence, 1993.](https://mlanthology.org/ijcai/1993/stephan1993ijcai-new/) doi:10.22028/D291-24866BibTeX
@inproceedings{stephan1993ijcai-new,
title = {{A New Logical Framework for Deductive Planning}},
author = {Stephan, Werner and Biundo, Susanne},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1993},
pages = {32-38},
doi = {10.22028/D291-24866},
url = {https://mlanthology.org/ijcai/1993/stephan1993ijcai-new/}
}