{"type":"ScholarlyArticle","title":"A Model Elimination Calculus for Generalized Clauses","authors":[{"name":"Toni Bollinger","slug":"toni-bollinger","given":"Toni","family":"Bollinger","affiliation":""}],"abstract":"Generalized clauses differ from (ordinary) clauses by allowing conjunctions of literals in the role of (ordinary) literals , i.e. they are disjlmctions of conjunctions of simple literals. An advantage of this clausal form is that implications with conjunctive conclusions or disjunctive premises are not split into multiple clallSes. An extension of Loveland's model elimination calculus [Loveland, 1969a, Loveland, 1978] is presented able to deal with such generalized clauses. Furthermore we describe a method for generating lemmas that. correspond to valid instances of cmljunctive conclusions. Using these lemmas it is po11sible to avoid multiple proofs of the premises of implications with conjunctive conclusions.","doi":null,"url":"https://ijcai.org/proceedings/1991/19","pdf":"https://ijcai.org/proceedings/1991/0019.pdf","markdown":"https://ijcai.org/proceedings/1991/19.md","bibtex":"https://ijcai.org/proceedings/1991/bibtex/19","volume":{"slug":"1991","title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1991","url":"https://ijcai.org/proceedings/1991/","year":1991,"location":"Sydney, New South Wales, Australia","dates":"24-30 August 1991","editors":"John Mylopoulos and Ray Reiter","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":19,"pages":{"first":126,"last":130},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}