Proving Termination Using Recursive Path Orders and SAT Solving

Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl. Proving Termination Using Recursive Path Orders and SAT Solving. In Boris Konev, Frank Wolter, editors, Frontiers of Combining Systems, 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007, Proceedings. Volume 4720 of Lecture Notes in Computer Science, pages 267-282, Springer, 2007. [doi]

Abstract

Abstract is missing.