Ramsey vs. Lexicographic Termination Proving

Byron Cook, Abigail See, Florian Zuleger. Ramsey vs. Lexicographic Termination Proving. In Nir Piterman, Scott A. Smolka, editors, Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. Volume 7795 of Lecture Notes in Computer Science, pages 47-61, Springer, 2013. [doi]

@inproceedings{CookSZ13,
  title = {Ramsey vs. Lexicographic Termination Proving},
  author = {Byron Cook and Abigail See and Florian Zuleger},
  year = {2013},
  doi = {10.1007/978-3-642-36742-7_4},
  url = {http://dx.doi.org/10.1007/978-3-642-36742-7_4},
  researchr = {https://researchr.org/publication/CookSZ13},
  cites = {0},
  citedby = {0},
  pages = {47-61},
  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings},
  editor = {Nir Piterman and Scott A. Smolka},
  volume = {7795},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-36741-0},
}