SAT solving for termination proofs with recursive path orders and dependency pairs

Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Fingerprint

Dive into the research topics of 'SAT solving for termination proofs with recursive path orders and dependency pairs'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science