A Simple Formalization of Actions Using Circumscription
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Temporal Reasoning. Pages 1970-1976.
Abstract
We present a simple circumscriptive method for formalizing actions with indirect effects (ramifications), and show that, in several examples , all second-order quantifiers can be eliminated from these formalizations using existing techniques for computing circumscriptions . One of the two symbolic computation methods employed here is a generalization of predicate completion and the other is based on the SCAN algorithm . The simplicity of our new approach to representing actions is due to th e use of the formalism of nested abnormality theories.
@inproceedings{ijcai1995p253,
title = {A Simple Formalization of Actions Using Circumscription},
author = {Kartha, G. Neelakantan and Lifschitz, Vladimir},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {1970--1976},
year = {1995},
note = {Temporal Reasoning},
url = {https://ijcai.org/proceedings/1995/253},
}
TY - CPAPER TI - A Simple Formalization of Actions Using Circumscription AU - Kartha, G. Neelakantan AU - Lifschitz, Vladimir T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1970 EP - 1976 UR - https://ijcai.org/proceedings/1995/253 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
