Maximal Completion

Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient completion procedure, which is based on MaxSAT solving. Experiments show that the procedure is comparable to recent powerful completion tools. 1998 ACM Subject Classification F.4.2 Grammars and Other Rewriting Systems

[1]  Gérard P. Huet,et al.  A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..

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

[3]  Yves Métivier.  About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm , 1983, Inf. Process. Lett..

[4]  Aart Middeldorp,et al.  OPTIMIZING MKBTT (SY STEM DESCRIPTION) , 2010 .

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

[6]  Azuma Ohuchi,et al.  Completion for Multiple Reduction Orderings , 1995, RTA.

[7]  Masahito Kurihara,et al.  Efficient BDD Encodings for Partial Order Constraints with Application to Expert Systems in Software Verification , 2004, IEA/AIE.

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

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

[10]  Nachum Dershowitz,et al.  Orderings for Equational Proofs , 1986, LICS.

[11]  Uday S. Reddy,et al.  Term Rewriting Induction , 1990, CADE.

[12]  Bruno Dutertre,et al.  A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.

[13]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

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

[15]  Hans Zantema,et al.  Matrix Interpretations for Proving Termination of Term Rewriting , 2006, Journal of Automated Reasoning.

[16]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

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

[18]  Aart Middeldorp,et al.  Termination Tools in Ordered Completion , 2010, IJCAR.

[19]  Takahito Aoto,et al.  Dealing with Non-orientable Equations in Rewriting Induction , 2006, RTA.

[20]  Aart Middeldorp,et al.  Tyrolean Termination Tool 2 , 2009, RTA.

[21]  Hans Zantema,et al.  Termination of Term Rewriting by Semantic Labelling , 1995, Fundam. Informaticae.

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

[23]  Peter J. Stuckey,et al.  Solving Partial Order Constraints for LPO Termination , 2005, J. Satisf. Boolean Model. Comput..