{"type":"ScholarlyArticle","title":"Completeness of the Negation as Failure Rule","authors":[{"name":"Joxan Jaffar","slug":"joxan-jaffar","given":"Joxan","family":"Jaffar","affiliation":""},{"name":"Jean-Louis Lassez","slug":"jean-louis-lassez","given":"Jean-Louis","family":"Lassez","affiliation":""},{"name":"John W. Lloyd","slug":"john-w-lloyd","given":"John W.","family":"Lloyd","affiliation":""}],"abstract":"Let P be a Horn clause logic program and com p(P) be its completion in th e sense of Clark . Clark gave a justification for the negation as failure rule by sho '.;in g that if a grou nd a tom A. is in the finite failur e set of P, then - A. is a logic9.l consequence of co mp ( P) , th9. t is , the neg9.tion as failure rule is so und. We prove he re that the converse also holds, that is, the negation as failure rule is compl ete .","doi":null,"url":"https://ijcai.org/proceedings/1983/121","pdf":"https://ijcai.org/proceedings/1983/0121.pdf","markdown":"https://ijcai.org/proceedings/1983/121.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/121","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Logic Programming","track":"Logic Programming","number":121,"pages":{"first":500,"last":505},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}