{"type":"ScholarlyArticle","title":"Logic Programming with General Clauses and Defaults Based on Model Elimination","authors":[{"name":"Marco A. Casanova","slug":"marco-a-casanova","given":"Marco A.","family":"Casanova","affiliation":""},{"name":"Ramiro A. de T. Guerreiro","slug":"ramiro-a-de-t-guerreiro","given":"Ramiro A. de T.","family":"Guerreiro","affiliation":""},{"name":"Andrea Silva","slug":"andrea-silva","given":"Andrea","family":"Silva","affiliation":""}],"abstract":"The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation method is an extended version of weak model elimination. The first question addressed is how to compute answers with weak model elimination when queries and programs are sets of arbitrary clauses, which is completely settled by a soundness and completeness result. The question of computing only definite answers is also settled. Then, the problem of computing answers is rediscussed when the logic programs also include a finite set of defaults.","doi":null,"url":"https://ijcai.org/proceedings/1989/63","pdf":"https://ijcai.org/proceedings/1989/0063.pdf","markdown":"https://ijcai.org/proceedings/1989/63.md","bibtex":"https://ijcai.org/proceedings/1989/bibtex/63","volume":{"slug":"1989","title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1989","url":"https://ijcai.org/proceedings/1989/","year":1989,"location":"Detroit, Michigan, USA","dates":"August 20-25 1989","editors":"N. S. Sridharan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Deduction","track":"Automated Deduction","number":63,"pages":{"first":395,"last":399},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}