Default connections in a modal planning framework
We present a framework for plan generation based on rather ordinary modal logic. To overcome the frame problem which is due to the monotonicity of traditional logic, this framework is enhanced by a particular kind of “default reasoning”, which is enabled by the particular way we have chosen to specify plan generation problems. We claim that the proposed framework translates the essential ideas of linear proofs [BIB 86b] into modal logic.
Keywordslogics for plan generation application of modal logic frame problem
Unable to display preview. Download preview PDF.
- [BIB 86a]Bibel, W.: Automated Theorem Proving, (second edition), Vieweg 1986.Google Scholar
- [BIB 86b]
- [FRO 83]Fronhöfer, B.: On Refinements of the Connection Method, COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 42, Algebra, Combinatorics and Logic in Computer Science, Györ, Hungary, 1983, pp. 391–401.Google Scholar
- [FRO 87]
- [FRO 89]Fronhöfer, B.: Default Connections in a Modal Planning Framework, Technical Report FKI-108-89, Institut für Informatik, TU München.Google Scholar
- [JAC 87]Jackson, P.; Reichgelt, H.: A General Proof Method for First-Order Logic, IJCAI-87, 10th International Joint Conference on Artificial Intelligence, Milan, Italy, August 87 (J.McDermott, ed.) pp. 942–944.Google Scholar
- [OHL 88]Ohlbach, H.-J.: A Resolution Calculus for Modal Logics, CADE-88, Argonne, Illinois, USA, May 1988 (E. Lusk, R. Overbeek, eds.) pp. 500–516.Google Scholar
- [WAL 87]Wallen, L.: Matrix Proof Methods for Modal Logics, IJCAI-87, 10th International Joint Conference on Artificial Intelligence, Milan, Italy, August 87 (J. McDermott, ed.) pp. 917–923.Google Scholar