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.
Abstract is missing.