A New Logical framework for Deductive Planning
Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 32-37.
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. A tactical theorem prover, the Karlsruhe Interactive Verifier KIV is used to implement this logical framework.
@inproceedings{ijcai1993p5,
title = {A New Logical framework for Deductive Planning},
author = {Stephan, Werner and Biundo, Susanne},
booktitle = {Proceedings of the Thirteenth International Joint Conference on
Artificial Intelligence, {IJCAI-93}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ruzena Bajcsy},
pages = {32--37},
year = {1993},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1993/5},
}
TY - CPAPER TI - A New Logical framework for Deductive Planning AU - Stephan, Werner AU - Biundo, Susanne T2 - Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93 PB - International Joint Conferences on Artificial Intelligence PY - 1993 SP - 32 EP - 37 UR - https://ijcai.org/proceedings/1993/5 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
