Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl. Proving Termination Using Recursive Path Orders and SAT Solving. In Boris Konev, Frank Wolter, editors, Frontiers of Combining Systems, 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007, Proceedings. Volume 4720 of Lecture Notes in Computer Science, pages 267-282, Springer, 2007. [doi]
@inproceedings{Schneider-KampTACG07,
title = {Proving Termination Using Recursive Path Orders and SAT Solving},
author = {Peter Schneider-Kamp and René Thiemann and Elena Annov and Michael Codish and Jürgen Giesl},
year = {2007},
doi = {10.1007/978-3-540-74621-8_18},
url = {http://dx.doi.org/10.1007/978-3-540-74621-8_18},
tags = {termination},
researchr = {https://researchr.org/publication/Schneider-KampTACG07},
cites = {0},
citedby = {0},
pages = {267-282},
booktitle = {Frontiers of Combining Systems, 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007, Proceedings},
editor = {Boris Konev and Frank Wolter},
volume = {4720},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-74620-1},
}