A decomposition method for CNF minimality proofs
- 1 October 2013
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 510, 111-126
Abstract
No abstract availableFunding Information
- NSF (CMMI-0856663, IIS-1161476)
- Czech Science Foundation (P202/10/1188)
This publication has 14 references indexed in Scilit:
- The complexity of Boolean formula minimizationJournal of Computer and System Sciences, 2011
- Exclusive and essential sets of implicates of Boolean functionsDiscrete Applied Mathematics, 2010
- A subclass of Horn CNFs optimally compressible in polynomial timeAnnals of Mathematics and Artificial Intelligence, 2009
- Complexity of two-level logic minimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2006
- The Minimum Equivalent DNF Problem and Shortest ImplicantsJournal of Computer and System Sciences, 2001
- Horn minimization by iterative decompositionAnnals of Mathematics and Artificial Intelligence, 1998
- Quasi-acyclic propositional Horn knowledge bases: optimal compressionIEEE Transactions on Knowledge and Data Engineering, 1995
- Optimal compression of propositional Horn knowledge bases: complexity and approximationArtificial Intelligence, 1993
- Minimal Representation of Directed HypergraphsSIAM Journal on Computing, 1986
- Minimum Covers in Relational Database ModelJournal of the ACM, 1980