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.
@inproceedings{Liberatore02:2,
title = {The Complexity of Checking Redundancy of CNF Propositional Formulae},
author = {Paolo Liberatore},
year = {2002},
tags = {redundancy},
researchr = {https://researchr.org/publication/Liberatore02%3A2},
cites = {0},
citedby = {0},
pages = {262-266},
booktitle = {Proceedings of the 15th Eureopean Conference on Artificial Intelligence, ECAI 2002, Lyon, France, July 2002},
editor = {Frank van Harmelen},
publisher = {IOS Press},
}