Paliath Narendran, Michaël Rusinowitch
The Theory of Total Unary RPO Is Decidable
ICLP, 2000.
@inproceedings{CL-2000-NarendranR,
author = "Paliath Narendran and Michaël Rusinowitch",
booktitle = "{Proceedings of the First International Conference on Computational Logic}",
doi = "10.1007/3-540-44957-4_44",
isbn = "3-540-67797-6",
pages = "660--672",
publisher = "{Springer-Verlag}",
series = "{Lecture Notes in Computer Science}",
title = "{The Theory of Total Unary RPO Is Decidable}",
volume = 1861,
year = 2000,
}
Tags: