Soundness and Completeness Theorems for Three Formalizations of Action
Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Knowledge Representation. Pages 724-730.
Abstract
Instead of trying to compare methodologies for reasoning about action on the basis of specific examples, we focus here on a general class of problems, expressible in a declarative language A . We propose three translations, P, R and B from A , representing respectively the first order methods of reasoning about action proposed by Pednault and Reiter and the circumscriptive approach of Baker. We then prove the soundness and completeness of these translations relati ve to the semantics of A . This lets us compare these three methods in a mathematically precise fashion . Moreover, we apply the methods of Baker in a general setting and prove a t h eo rem which shows that if the domain of interest can be expressed in A, circumscription yields results which are intuitively expected .
@inproceedings{ijcai1993p102,
title = {Soundness and Completeness Theorems for Three Formalizations of Action},
author = {Kartha, G. Neelakantan},
booktitle = {Proceedings of the Thirteenth International Joint Conference on
Artificial Intelligence, {IJCAI-93}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ruzena Bajcsy},
pages = {724--730},
year = {1993},
note = {Knowledge Representation},
url = {https://ijcai.org/proceedings/1993/102},
}
TY - CPAPER TI - Soundness and Completeness Theorems for Three Formalizations of Action AU - Kartha, G. Neelakantan T2 - Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93 PB - International Joint Conferences on Artificial Intelligence PY - 1993 SP - 724 EP - 730 UR - https://ijcai.org/proceedings/1993/102 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
