Efficient Checking of Term Ordering Constraints

Simplification orderings on terms play a crucial role in reducing the search space in paramodulation-based theorem proving. Such a use of orderings requires checking simple ordering constraints on substitutions as an essential part of many operations. Due to their frequency, such checks are costly and are a good target for optimisation. In this paper we present an efficient implementation technique for checking constraints in one of the most widely used simplification orderings, the Knuth-Bendix ordering. The technique is based on the idea of run-time algorithm specialisation, which is a close relative of partial evaluation.

[1]  Stephan Schulz,et al.  E - a brainiac theorem prover , 2002, AI Commun..

[2]  Peter Sestoft,et al.  Partial evaluation and automatic program generation , 1993, Prentice Hall international series in computer science.

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

[4]  Andrei Voronkov,et al.  The design and implementation of VAMPIRE , 2002, AI Commun..

[5]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[6]  Robert Nieuwenhuis,et al.  Practical Algorithms for Deciding Path Ordering Constraint Satisfaction , 2002, Inf. Comput..

[7]  Thomas Hillenbrand,et al.  A phytography of WALDMEISTER , 2002, AI Commun..

[8]  Andrei Voronkov,et al.  The anatomy of vampire , 1995, Journal of Automated Reasoning.

[9]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[11]  H. Brown,et al.  Computational Problems in Abstract Algebra , 1971 .

[12]  Andrei Voronkov,et al.  Partially Adaptive Code Trees , 2000, JELIA.

[13]  Jacques D. Fleuriot,et al.  IsaPlanner: A Prototype Proof Planner in Isabelle , 2003, CADE.

[14]  Andrei Voronkov,et al.  Limited resource strategy in resolution theorem proving , 2003, J. Symb. Comput..

[15]  Andrei Voronkov,et al.  Orienting rewrite rules with the Knuth-Bendix order , 2003, Inf. Comput..

[16]  Alan Robinson,et al.  The Inverse Method , 2001, Handbook of Automated Reasoning.

[17]  Andrei Voronkov,et al.  Efficient Instance Retrieval with Standard and Relational Path Indexing , 2003, CADE.

[18]  Andrei Voronkov,et al.  Efficient instance retrieval with standard and relational path indexing , 2005, Inf. Comput..

[19]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, Journal of Automated Reasoning.