{"type":"ScholarlyArticle","title":"Subsumption And Connection Graphs","authors":[{"name":"Norbert Eisinger","slug":"norbert-eisinger","given":"Norbert","family":"Eisinger","affiliation":""}],"abstract":"A subsumption test based on the principal idea of Kowalski's connection graph proof procedure is developed. In contrast to the standard test this new test is sufficiently efficient to permit the unrestricted use of the subsumption rule in practice. The test is not limited to the connection graph proof procedure, but most naturally embedded into it. In the latter case the unrestricted combination of subsumption with other deletion rules is shown to be inconsistent.","doi":null,"url":"https://ijcai.org/proceedings/1981/92","pdf":"https://ijcai.org/proceedings/1981/0092.pdf","markdown":"https://ijcai.org/proceedings/1981/92.md","bibtex":"https://ijcai.org/proceedings/1981/bibtex/92","volume":{"slug":"1981","title":"Proceedings of the Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1981","url":"https://ijcai.org/proceedings/1981/","year":1981,"location":"Vancouver, British Columbia, Canada","dates":"24-28 August 1981","editors":"Roger C. Schank","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theoretical Foundations","track":"Theoretical Foundations","number":92,"pages":{"first":480,"last":485},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}