A Knuth-Bendix-Like Ordering for Orienting Combinator Equations

We extend the graceful higher-order basic Knuth-Bendix order (KBO) of Becker et al. to an ordering that orients combinator equations left-to-right. The resultant ordering is highly suited to parameterising the first-order superposition calculus when dealing with the theory of higher-order logic, as it prevents inferences between the combinator axioms. We prove a number of desirable properties about the ordering including it having the subterm property for ground terms, being transitive and being well-founded. The ordering fails to be a reduction ordering as it lacks compatibility with certain contexts. We provide an intuition of why this need not be an obstacle when using it to parameterise superposition.

[1]  Lawrence C. Paulson,et al.  The Higher-Order Prover Leo-II , 2015, Journal of Automated Reasoning.

[2]  Lawrence C. Paulson,et al.  Translating Higher-Order Clauses to First-Order Clauses , 2007, Journal of Automated Reasoning.

[3]  Uwe Waldmann,et al.  Superposition with Lambdas , 2019, Journal of Automated Reasoning.

[4]  Chad E. Brown,et al.  Satallax: An Automatic Higher-Order Prover , 2012, IJCAR.

[5]  Manfred Kerber.  How to Prove Higher Order Theorems in First Order Logic , 1991, IJCAI.

[6]  Albert Rubio,et al.  The Computability Path Ordering: The End of a Quest , 2008, CSL.

[7]  Peter Graf.  Substitution Tree Indexing , 1995, RTA.

[8]  Paula Severi,et al.  Perpetual Reductions in Lambda-Calculus , 1999, Inf. Comput..

[9]  Ahmed Bhayat,et al.  A Combinator-Based Superposition Calculus for Higher-Order Logic , 2020, IJCAR.

[10]  Alexander Steen,et al.  Extensional Paramodulation for Higher-Order Logic and Its Effective Implementation Leo-III , 2019, KI - Künstliche Intelligenz.

[11]  Uwe Waldmann,et al.  A Lambda-Free Higher-Order Recursive Path Order , 2017, FoSSaCS.

[12]  Albert Rubio,et al.  Polymorphic higher-order recursive path orderings , 2007, JACM.

[13]  Cynthia Kop,et al.  A Higher-Order Iterative Path Ordering , 2008, LPAR.

[14]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

[15]  I. V. Ramakrishnan,et al.  Term Indexing , 2001, Handbook of Automated Reasoning.

[16]  J. Roger Hindley,et al.  Lambda-Calculus and Combinators: An Introduction , 2008 .

[17]  Lawrence C. Paulson,et al.  LEO-II and Satallax on the Sledgehammer test bench , 2013, J. Appl. Log..

[18]  Cezary Kaliszyk,et al.  Hammer for Coq: Automation for Dependent Type Theory , 2018, Journal of Automated Reasoning.

[19]  Heiko Becker,et al.  A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms , 2017, CADE.

[20]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[21]  Albert Rubio,et al.  Paramodulation with non-monotonic orderings , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).