The Complexity of Checking Redundancy of CNF Propositional Formulae

Paolo Liberatore. The Complexity of Checking Redundancy of CNF Propositional Formulae. In Frank van Harmelen, editor, Proceedings of the 15th Eureopean Conference on Artificial Intelligence, ECAI 2002, Lyon, France, July 2002. pages 262-266, IOS Press, 2002.

Abstract

Abstract is missing.