Sufficient Completness, Term Rewriting Systems and Anti-Unification

Hubert Comon. Sufficient Completness, Term Rewriting Systems and Anti-Unification . In Jörg H. Siekmann, editor, 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings. Volume 230 of Lecture Notes in Computer Science, pages 128-140, Springer, 1986.

@inproceedings{Comon86,
  title = {Sufficient Completness, Term Rewriting Systems and  Anti-Unification },
  author = {Hubert Comon},
  year = {1986},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Comon86},
  cites = {0},
  citedby = {0},
  pages = {128-140},
  booktitle = {8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings},
  editor = {Jörg H. Siekmann},
  volume = {230},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-16780-3},
}