Compiling Prioritized Circumscription into Extended Logic Programs
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 182-188.
Abstract
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show theoretically that any circumscription whose theory contains both the domain closure axiom and the uniqueness of names axioms can always be compiled into an extended logic program II, so that, whether a ground literal is provable from circumscription or not, can always be evaluated by deciding whether the literal is true in all answer sets ofii, which can be computed by running II under the existing logic programming interpreter.
@inproceedings{ijcai1997p28,
title = {Compiling Prioritized Circumscription into Extended Logic Programs},
author = {Wakaki, Toshiko and Satoh, Ken},
booktitle = {Proceedings of the Fifteenth International Joint Conference on
Artificial Intelligence, {IJCAI-97}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Martha E. Pollack},
pages = {182--188},
year = {1997},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1997/28},
}
TY - CPAPER TI - Compiling Prioritized Circumscription into Extended Logic Programs AU - Wakaki, Toshiko AU - Satoh, Ken T2 - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97 PB - International Joint Conferences on Artificial Intelligence PY - 1997 SP - 182 EP - 188 UR - https://ijcai.org/proceedings/1997/28 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
