Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time

Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder. Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. In Ewing L. Lusk, Ross A. Overbeek, editors, 9th International Conference on Automated Deduction, Argonne, Illinois, USA, May 23-26, 1988, Proceedings. Volume 310 of Lecture Notes in Computer Science, pages 182-196, Springer, 1988.

@inproceedings{GallierNPRS88,
  title = {Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time},
  author = {Jean H. Gallier and Paliath Narendran and David A. Plaisted and Stan Raatz and Wayne Snyder},
  year = {1988},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GallierNPRS88},
  cites = {0},
  citedby = {0},
  pages = {182-196},
  booktitle = {9th International Conference on Automated Deduction, Argonne, Illinois, USA, May 23-26, 1988, Proceedings},
  editor = {Ewing L. Lusk and Ross A. Overbeek},
  volume = {310},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-19343-X},
}