Camilo Rocha, José Meseguer. Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories. In Christian G. Fermüller, Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings. Volume 6397 of Lecture Notes in Computer Science, pages 594-609, Springer, 2010. [doi]
@inproceedings{RochaM10, title = {Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories}, author = {Camilo Rocha and José Meseguer}, year = {2010}, doi = {10.1007/978-3-642-16242-8_42}, url = {http://dx.doi.org/10.1007/978-3-642-16242-8_42}, tags = {completeness, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/RochaM10}, cites = {0}, citedby = {0}, pages = {594-609}, booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings}, editor = {Christian G. Fermüller and Andrei Voronkov}, volume = {6397}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-16241-1}, }