{"type":"ScholarlyArticle","title":"Model Elimination, Logic Programming and Computing Answers","authors":[{"name":"Peter Baumgartner","slug":"peter-baumgartner","given":"Peter","family":"Baumgartner","affiliation":""},{"name":"Ulrich Furbach","slug":"ulrich-furbach","given":"Ulrich","family":"Furbach","affiliation":""},{"name":"Frieder Stolzenburg","slug":"frieder-stolzenburg","given":"Frieder","family":"Stolzenburg","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1995/44","pdf":"https://ijcai.org/proceedings/1995/0044.pdf","markdown":"https://ijcai.org/proceedings/1995/44.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/44","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":44,"pages":{"first":335,"last":340},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}