{"type":"ScholarlyArticle","title":"Equality Reasoning in Clause Graphics","authors":[{"name":"Karl-Hans Bläsius","slug":"karl-hans-blasius","given":"Karl-Hans","family":"Bläsius","affiliation":""}],"abstract":"A method to control the application of equalityderivation rules in an automatic theorem proving system is presented . When handling eq uality in the search for a pro o f of a theorem two main problems arise: 1) to obtain a control mechanism for the s ea r ch and application of useful equality derivation steps in order to support global strategies which plan and control the whole proof , thus conducing to an efficient and complete proof procedure. 2) to find proper equations rendering two t e rms unifiable. Thes e pr ob lems are solved by combining th e c laus e graph method and the \"paramodulation-if-needed\" idea by introducing Morris' E-resolution into th e clause graph proof procedure. The n eces sary equations to form possible E-resolvents are searched for in th e initial graph and are inh e rited afterwards. Th e search space f o r possible E -resolutions will be r ed uced by exploiting constraints using th e information in the clause graph.","doi":null,"url":"https://ijcai.org/proceedings/1983/221","pdf":"https://ijcai.org/proceedings/1983/0221.pdf","markdown":"https://ijcai.org/proceedings/1983/221.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/221","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":"Theorem Proving","track":"Theorem Proving","number":221,"pages":{"first":936,"last":938},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}