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.- Sort by
- Weight
- Alphabetically
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 journal › Article › peer-review
17
Scopus
citations