Exclusive and essential sets of implicates of Boolean functions
Authors:
- Endre BorosEBEndre Boros
- Ondřej ČepekOČOndřej Čepek
- Alexander KoganAKAlexander Kogan
- Petr KučeraPKPetr Kučera
- 1 January 2010
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (2) , 81-96
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- 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
- Horn functions and their DNFsInformation Processing Letters, 1992
- Minimal Representation of Directed HypergraphsSIAM Journal on Computing, 1986
- Minimum Covers in Relational Database ModelJournal of the ACM, 1980
- Decomposition of a Data Base and the Theory of Boolean Switching FunctionsIBM Journal of Research and Development, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- A Way to Simplify Truth FunctionsThe American Mathematical Monthly, 1955
- The Problem of Simplifying Truth FunctionsThe American Mathematical Monthly, 1952