P. Liberatore. The complexity of checking redundancy of CNF propositional formulae. In Proc. 15th European Conference on Artificial Intelligence, pages 262--266. IEEE, IOS Press, July 2002. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Data Integration Techniques in Grid Monitoring - Cooke, Gray, Nutt (Correct)
No context found.
P. Liberatore. The complexity of checking redundancy of CNF propositional formulae. In Proc. 15th European Conference on Artificial Intelligence, pages 262--266. IEEE, IOS Press, July 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC