SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
- 作者Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann
- 卷第49卷
- 期第1期
- 印刷ISSN0168-7433
- 电子ISSN1573-0670
- 文件大小672.52KB
- 发表时间2012-06
- DOI10.1007/s10817-010-9211-0
- 页码53-93