SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann. SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. Journal of Automated Reasoning, 49(1):53-93, 2012. [doi]

Abstract

Abstract is missing.