论文信息 - A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion∗

A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion∗

We present a general approach to encode termination in the dependency pair framework as a satisfiability problem, and include encodings of dependency graph and reduction pair processors. We use our encodings to increase the power of the completion tool Maxcomp.

Haruhiko Sato | Sarah Winkler

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

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

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

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

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

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

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

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