Shan-Hwei Nienhuys-Cheng, Ronald de Wolf. The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution. In Kanchana Kanchanasut, Jean-Jacques Lévy, editors, Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science Conference, ACSC 95, Pathumthani, Tailand, December 11-13, 1995, Proceedings. Volume 1023 of Lecture Notes in Computer Science, pages 269-285, Springer, 1995.
@inproceedings{Hienhuys-ChengW95,
title = {The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution},
author = {Shan-Hwei Nienhuys-Cheng and Ronald de Wolf},
year = {1995},
tags = {completeness},
researchr = {https://researchr.org/publication/Hienhuys-ChengW95},
cites = {0},
citedby = {0},
pages = {269-285},
booktitle = {Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science Conference, ACSC 95, Pathumthani, Tailand, December 11-13, 1995, Proceedings},
editor = {Kanchana Kanchanasut and Jean-Jacques Lévy},
volume = {1023},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-60688-2},
}