{"type":"ScholarlyArticle","title":"A Many-Sorted Resolution Based on an Extension of a First-Order Language","authors":[{"name":"Keki B. Irani","slug":"keki-b-irani","given":"Keki B.","family":"Irani","affiliation":""},{"name":"D. G. Shin","slug":"d-g-shin","given":"D. G.","family":"Shin","affiliation":""}],"abstract":"A type of problern is first identified which may occur when a resolution scheme is applied to a many-sorted theory. To avoid euch a problem, an extension of the rlr!lt·order langnage called one-1orted language witla aggregale tJariable• is introduced. Aggregate variables allow the introduction of range-restricted variables dynamically in the structure which is expanded by definitions. This allows the introduction of a new resolution scheme called UWR-re10lution . It ean be shown that the UWR-resolution is more efficient than the existing schemes.","doi":null,"url":"https://ijcai.org/proceedings/1985/238","pdf":"https://ijcai.org/proceedings/1985/0238.pdf","markdown":"https://ijcai.org/proceedings/1985/238.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/238","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":238,"pages":{"first":1175,"last":1176},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}