Higher-Order Order-Sorted Resolution

The introduction of sorts to first-order automated deduction has broughtgreater conciseness of representation and a considerable gain in efficiency byreducing the search space. It is therefore promising to treat sorts in higherorder theorem proving as well.In this paper we present a generalization of Huet's Constrained Resolutionto an order-sorted type theory SigmaT with term declarations. This system buildscertain taxonomic axioms into the unification and conducts reasoning withthem in a controlled way. We make this notion precise by giving a relativizationoperator that totally and faithfully encodes SigmaT into simple type theory.

[1]  M. Schmidt-Schauβ.  Computational Aspects of an Order-Sorted Logic with Term Declarations , 1989 .

[2]  B. Pierce.  Programming with intersection types and bounded polymorphism , 1992 .

[3]  Michael Kohlhase,et al.  Unification in Order-Sorted Type Theory , 1992, LPAR.

[4]  Zhenyu Qian,et al.  Reduction and Unification in Lambda Calculi with Subtypes , 1992, CADE.

[5]  Christoph Weidenbach,et al.  A sorted logic using dynamic sorts , 1991 .

[6]  Wolfgang Bibel,et al.  Proceedings of the 5th Conference on Automated Deduction , 1980 .

[7]  Dale A. Miller,et al.  Proofs in Higher-Order Logic , 1983 .

[8]  Peter B. Andrews.  Resolution in type theory , 1971, Journal of Symbolic Logic.

[9]  Patricia Johann,et al.  Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading , 1994, CADE.

[10]  Peter B. Andrews.  An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.

[11]  Christoph Walther,et al.  A Many-Sorted Calculus Based on Resolution and Paramodulation , 1982, IJCAI.

[12]  Zhenyu Qian,et al.  Extensions of order-sorted algebraic specifications: parameterization, higher-order functions and polymorphism , 1991 .

[13]  Gérard Huet,et al.  Constrained resolution: a complete method for higher-order logic. , 1972 .

[14]  Frank Pfenning,et al.  Unification in a l-calculus with intersection types , 1993, ICLP 1993.

[15]  Kim B. Bruce,et al.  A modest model of records, inheritance and bounded quantification , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[16]  Luca Cardelli,et al.  A Semantics of Multiple Inheritance , 1984, Inf. Comput..

[17]  Wayne Snyder,et al.  Higher-Order Unification Revisited: Complete Sets of Transformations , 1989, J. Symb. Comput..

[18]  Arnold Oberschelp.  Untersuchungen zur mehrsortigen Quantorenlogik , 1962 .

[19]  Anthony G. Cohn,et al.  Taxonomic reasoning with many-sorted logics , 1989, Artificial Intelligence Review.

[20]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[21]  Frank Pfenning,et al.  Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning , 1994, ICLP 1994.