OPTIMIZING MKBTT (SY STEM DESCRIPTION)

We d escribe performance enhancements that have been added to mkbTT, a modern completion tool combining multi-completion with the use of termination tools.

[1]  Nachum Dershowitz,et al.  Critical Pair Criteria for Completion , 1988, J. Symb. Comput..

[2]  Nao Hirokawa,et al.  Tyrolean Termination Tool , 2005, RTA.

[3]  Aart Middeldorp,et al.  Constraint-Based Multi-Completion Procedures for Term Rewriting Systems , 2009, IEICE Trans. Inf. Syst..

[4]  Geoff Sutcliffe.  The TPTP Problem Library and Associated Infrastructure , 2009, Journal of Automated Reasoning.

[5]  I. V. Ramakrishnan,et al.  Term Indexing , 1995, Lecture Notes in Computer Science.

[6]  William McCune,et al.  Experiments with discrimination-tree indexing and path indexing for term retrieval , 1992, Journal of Automated Reasoning.

[7]  Andrei Voronkov,et al.  Algorithms, Datastructures, and other Issues in Efficient Automated Deduction , 2001, IJCAR.

[8]  Jürgen Giesl,et al.  Automatic Termination Proofs in the Dependency Pair Framework , 2006, IJCAR.

[9]  Paliath Narendran,et al.  Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure , 1988, J. Symb. Comput..

[10]  Wolfgang Küchlin,et al.  A Confluence Criterion Based on the Generalised Neman Lemma , 1985, European Conference on Computer Algebra.

[11]  Aaron Stump,et al.  Mining Propositional Simplification Proofs for Small Validating Clauses , 2006, Electron. Notes Theor. Comput. Sci..

[12]  Masahito Kurihara,et al.  Completion for Multiple Reduction Orderings , 1995, Journal of Automated Reasoning.

[13]  Wolfgang Küchlin,et al.  A fine-grained parallel completion procedure , 1994, ISSAC '94.

[14]  Nachum Dershowitz,et al.  Equational inference, canonical proofs, and proof orderings , 1994, JACM.

[15]  J. Christian.  Fast Knuth-Bendix completion , 1989 .

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

[17]  Raúl Gutiérrez,et al.  Proving Termination of Context-Sensitive Rewriting with MU-TERM , 2007, PROLE.

[18]  Aart Middeldorp,et al.  Multi-completion with Termination Tools (System Description) , 2008, IJCAR.

[19]  Bernd Löchner,et al.  Knuth-Bendix completion of theories of commuting group endomorphisms , 2006, Inf. Process. Lett..

[20]  Aaron Stump,et al.  Slothrop: Knuth-Bendix Completion with a Modern Termination Checker , 2006, RTA.