{"type":"ScholarlyArticle","title":"Consolution and its Relation with Resolution","authors":[{"name":"Elmar Eder","slug":"elmar-eder","given":"Elmar","family":"Eder","affiliation":""}],"abstract":"In this paper the method of consolution for clause form theorem proving is introduced . Consolution is based on the connection method. This means that in a consolution derivation the paths through the input formula are checked for complementarity. In contrast to resolution this checking can be done in a systematic way as in any connection calculus. It is proved that the consolution calculus presented here is sound and complete and that it can simulate resolution step by step and is a generalization of resolution. It combines the advantages of the connection method such as the directedness of search with the advantages of resolution such as the possibility of the use of lemmata.","doi":null,"url":"https://ijcai.org/proceedings/1991/20","pdf":"https://ijcai.org/proceedings/1991/0020.pdf","markdown":"https://ijcai.org/proceedings/1991/20.md","bibtex":"https://ijcai.org/proceedings/1991/bibtex/20","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":20,"pages":{"first":132,"last":135},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}