{"type":"ScholarlyArticle","title":"Automated Deduction by Theory Resolution","authors":[{"name":"Mark E. Stickel","slug":"mark-e-stickel","given":"Mark E.","family":"Stickel","affiliation":""}],"abstract":"Theory resolution constitutes a set of complete procedures for incorporating theories into a resolution theorem-proving program, thereby making it unnecessary to resolve directly upon axioms of the theory. This can greatly reduce the length of proofs and the size of the search space. Theory resolution efl'ects a beneficial division of Iabor, improving the performance of the theorem prover and increasing the applicability of the specialized reasoning procedures. Applications include the building in of both mathemat· ical and special decision. procedures, e.g., for the taxonomic information furnished by a knowledge representation system . Theory resolution is a generalization of numerous previously known resolution refinements. lts power is demonstrated by comparing solutions of \"Schubert's Steamroller\" challenge problern with and without building in axioms through theory resolution.","doi":null,"url":"https://ijcai.org/proceedings/1985/240","pdf":"https://ijcai.org/proceedings/1985/0240.pdf","markdown":"https://ijcai.org/proceedings/1985/240.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/240","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theorem Proving","track":"Theorem Proving","number":240,"pages":{"first":1181,"last":1185},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}