SAT Solving for Termination Proofs with Recursive Path...

Journal of Automated Reasoning 2012 / 06 Vol. 49; Iss. 1

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

Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
49
Language:
english
Pages:
41
DOI:
10.1007/s10817-010-9211-0
Date:
June, 2012
File:
PDF, 673 KB
english, 2012
Conversion to is in progress
Conversion to is failed