Model Elimination, Logic Programming and Computing Answers
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 335-340.
Abstract
We demonstrate that theorem provers using model elimination (ME) can be used as answer complete interpreters for disjunctive logic programming. More specifically, we introduce a mechanism for computing answers into the restart variant of ME. Building on this, we develop a new calculus called ancestry restart ME. This variant admits a more restrictive regularity restriction than restart ME, and, as a side effect, it is in particular attractive for computing definite answers. The presented calculi can also be used successfully in the context of automated theorem proving. We demonstrate experimentally that it is more difficult to compute (nontrivial) answers to goals, instead of only proving the existence of answers.
@inproceedings{ijcai1995p44,
title = {Model Elimination, Logic Programming and Computing Answers},
author = {Baumgartner, Peter and Furbach, Ulrich and Stolzenburg, Frieder},
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 = {335--340},
year = {1995},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1995/44},
}
TY - CPAPER TI - Model Elimination, Logic Programming and Computing Answers AU - Baumgartner, Peter AU - Furbach, Ulrich AU - Stolzenburg, Frieder T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 335 EP - 340 UR - https://ijcai.org/proceedings/1995/44 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: