%0 Conference Paper %1 conf/wflp/SakataNS11 %A Sakata, Tsubasa %A Nishida, Naoki %A Sakabe, Toshiki %B WFLP %D 2011 %E Kuchen, Herbert %I Springer %K dblp %P 138-155 %T On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs. %U http://dblp.uni-trier.de/db/conf/wflp/wflp2011.html#SakataNS11 %V 6816 %@ 978-3-642-22530-7

@inproceedings{conf/wflp/SakataNS11, added-at = {2017-05-24T00:00:00.000+0200}, author = {Sakata, Tsubasa and Nishida, Naoki and Sakabe, Toshiki}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2dee08e21daafb094d66c9967f6754573/dblp}, booktitle = {WFLP}, crossref = {conf/wflp/2011}, editor = {Kuchen, Herbert}, ee = {https://doi.org/10.1007/978-3-642-22531-4_9}, interhash = {393f43da270139a2ac5afd27a6804c54}, intrahash = {dee08e21daafb094d66c9967f6754573}, isbn = {978-3-642-22530-7}, keywords = {dblp}, pages = {138-155}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-27T14:55:50.000+0200}, title = {On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs.}, url = {http://dblp.uni-trier.de/db/conf/wflp/wflp2011.html#SakataNS11}, volume = 6816, year = 2011 }