Query Answering in Circumscription
Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Knowledge Representation. Pages 426-430.
Abstract
We address the problem of answering queries in circumscription and related nonmonotonic formalisms. The answering process we describe uses resolution-based theorem provers recently developed for circumscription. In a way analogous to query answering techniques in classical predicate logic, the process extracts information from a proof of the query. Circumscriptive theorem provers consist of two processes, generating explanations for the theorem to be proved and showing that these explanations cannot be refuted. In general, many explanations compete in supporting the theorem. We show that queries can be answered by finding certain combinations of explanations, and present results to search the space of explanations, while carrying out significant pruning on this space. The results are relevant to other nonmonotonic formalisms having explanation-based proof procedures.
@inproceedings{ijcai1991p64,
title = {Query Answering in Circumscription},
author = {Helft, Nicolas and Inoue, Katsumi and Poole, David},
booktitle = {Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, {IJCAI-91}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John Mylopoulos and Ray Reiter},
pages = {426--430},
year = {1991},
month = {8},
note = {Knowledge Representation},
url = {https://ijcai.org/proceedings/1991/64},
}
TY - CPAPER TI - Query Answering in Circumscription AU - Helft, Nicolas AU - Inoue, Katsumi AU - Poole, David T2 - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91 PB - International Joint Conferences on Artificial Intelligence PY - 1991 SP - 426 EP - 430 UR - https://ijcai.org/proceedings/1991/64 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
