Horn minimization by iterative decomposition
From MaRDI portal
Publication:1277344
DOI10.1023/A:1018932728409zbMath0913.68192MaRDI QIDQ1277344
Ondřej Čepek, Endre Boros, Alexander Kogan
Publication date: 2 February 1999
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018932728409
Related Items
Approximating Minimum Representations of Key Horn Functions, A decomposition method for CNF minimality proofs, Relations between threshold and \(k\)-interval Boolean functions, A subclass of Horn CNFs optimally compressible in polynomial time, Disjoint essential sets of implicates of a CQ Horn function, Exclusive and essential sets of implicates of Boolean functions, On functional dependencies in \(q\)-Horn theories, Recognition of tractable DNFs representable by a constant number of intervals, Boolean functions with long prime implicants