SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Michael Codish' in GoogleThis author has not been identified. It may be one of the following persons:

Jürgen Giesl

Look up 'Jürgen Giesl' in GoogleThis author has not been identified. Look up 'Peter Schneider-Kamp' in GoogleThis author has not been identified. Look up 'René Thiemann' in Google

runs on WebDSL