Encoding Dependency Pair Techniques and Control Strategies for Maximal Completion

This paper describes two advancements of SAT-based Knuth-Bendix completion as implemented in Maxcomp. (1) Termination techniques using the dependency pair framework are encoded as satisfiability problems, including dependency graph and reduction pair processors. (2) Instead of relying on pure maximal completion, different SAT-encoded control strategies are exploited.

[1]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

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

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

[4]  Aart Middeldorp,et al.  Multi-Completion with Termination Tools , 2012, Journal of Automated Reasoning.

[5]  Nao Hirokawa,et al.  Constraints for Argument Filterings , 2007, SOFSEM.

[6]  Haruhiko Sato,et al.  A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion∗ , 2014 .

[7]  Akihisa Yamada,et al.  A unified ordering for termination proving , 2014, Sci. Comput. Program..

[8]  Konstantin Korovin,et al.  Inst-Gen - A Modular Approach to Instantiation-Based Automated Reasoning , 2013, Programming Logics.

[9]  Thomas Sternagel,et al.  KBCV - Knuth-Bendix Completion Visualizer , 2012, IJCAR.

[10]  Nao Hirokawa,et al.  Maximal Completion , 2011, RTA.

[11]  Jürgen Giesl,et al.  Proving Termination Using Recursive Path Orders and SAT Solving , 2007, FroCoS.

[12]  Jürgen Giesl,et al.  The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs , 2005, LPAR.

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

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

[15]  Nao Hirokawa,et al.  KBO Orientability , 2009, Journal of Automated Reasoning.