{"type":"ScholarlyArticle","title":"A Many-Sorted Calculus Based on Resolution and Paramodulation","authors":[{"name":"Christoph Walther","slug":"christoph-walther","given":"Christoph","family":"Walther","affiliation":""}],"abstract":"The first-order ca l c ulus whose well formed formulas are clauses and whose sole inference rules are factorization, resolution and paramodulation is extended to a many-sorted calculus. As abasis for Automated Theorem Proving, this many-sorted calcu lus le ads to a remarka ble reduction of thesearch space and also to simpler proofs. The soundness and completeness of th e new ca lculus and the Sort-Theorem, which relate s t he many-sorted c alculus to its one -s o rt ed cou nterpart, are shown. Inaddition results about term rewriting a nd unification in a many-sorted calculus are obtained. Pra ctical examp l es and a proof protocol of an automated th eorem proverbased on the many-sorted calculus a re presented.","doi":null,"url":"https://ijcai.org/proceedings/1983/211","pdf":"https://ijcai.org/proceedings/1983/0211.pdf","markdown":"https://ijcai.org/proceedings/1983/211.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/211","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":211,"pages":{"first":882,"last":890},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}