Tsubasa Sakata, Naoki Nishida, Toshiki Sakabe. On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs. In Herbert Kuchen, editor, Functional and Constraint Logic Programming - 20th International Workshop, WFLP 2011, Odense, Denmark, July 19th, Proceedings. Volume 6816 of Lecture Notes in Computer Science, pages 138-155, Springer, 2011. [doi]
@inproceedings{SakataNS11,
title = {On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs},
author = {Tsubasa Sakata and Naoki Nishida and Toshiki Sakabe},
year = {2011},
doi = {10.1007/978-3-642-22531-4_9},
url = {http://dx.doi.org/10.1007/978-3-642-22531-4_9},
tags = {term rewriting, termination, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/SakataNS11},
cites = {0},
citedby = {0},
pages = {138-155},
booktitle = {Functional and Constraint Logic Programming - 20th International Workshop, WFLP 2011, Odense, Denmark, July 19th, Proceedings},
editor = {Herbert Kuchen},
volume = {6816},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-22530-7},
}