Sergei G. Vorobyov. A structural completeness theorem for a class of conditional rewrite rule systems. In Per Martin-Löf, Grigori Mints, editors, COLOG-88, International Conference on Computer Logic, Tallinn, USSR, December 1988, Proceedings. Volume 417 of Lecture Notes in Computer Science, pages 313-326, Springer, 1988.
@inproceedings{Vorobyov88,
title = {A structural completeness theorem for a class of conditional rewrite rule systems},
author = {Sergei G. Vorobyov},
year = {1988},
tags = {rule-based, completeness, graph-rewriting, rules, rewriting},
researchr = {https://researchr.org/publication/Vorobyov88},
cites = {0},
citedby = {0},
pages = {313-326},
booktitle = {COLOG-88, International Conference on Computer Logic, Tallinn, USSR, December 1988, Proceedings},
editor = {Per Martin-Löf and Grigori Mints},
volume = {417},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-52335-9},
}