{"type":"ScholarlyArticle","title":"Completeness Theorems for Semantic Resolution in Consequence-Finding","authors":[{"name":"James R. Slagle","slug":"james-r-slagle","given":"James R.","family":"Slagle","affiliation":""},{"name":"Chin-Liang Chang","slug":"chin-liang-chang","given":"Chin-Liang","family":"Chang","affiliation":""},{"name":"Richard C. T. Lee","slug":"richard-c-t-lee","given":"Richard C. T.","family":"Lee","affiliation":""}],"abstract":"The object of consequence-finding is to deduce logical consequences from a set of axioms. The theory of J.R. Slagle's semantic resolution principle, an inference rule for first-order predicate calculus, is extended to consequence-finding. Given an interpretation I, it is proved that any prime (non-trivial) consequence, which is false in I, can be derived from a set of axioms by applying !-(semantic) resolution.","doi":null,"url":"https://ijcai.org/proceedings/1969/27","pdf":"https://ijcai.org/proceedings/1969/0027.pdf","markdown":"https://ijcai.org/proceedings/1969/27.md","bibtex":"https://ijcai.org/proceedings/1969/bibtex/27","volume":{"slug":"1969","title":"Proceedings of the First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1969","url":"https://ijcai.org/proceedings/1969/","year":1969,"location":"Washington, DC, USA","dates":"May 7-9, 1969","editors":"Donald E. Walker and David C. Cooper","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theorem Proving","track":"Theorem Proving","number":27,"pages":{"first":281,"last":286},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}