Horn minimization by iterative decomposition
From MaRDI portal
Publication:1277344
DOI10.1023/A:1018932728409zbMath0913.68192OpenAlexW1556415569MaRDI 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
A decomposition method for CNF minimality proofs ⋮ Relations between threshold and \(k\)-interval Boolean functions ⋮ Boolean functions with long prime implicants ⋮ Recognition of tractable DNFs representable by a constant number of intervals ⋮ A subclass of Horn CNFs optimally compressible in polynomial time ⋮ Exclusive and essential sets of implicates of Boolean functions ⋮ Disjoint essential sets of implicates of a CQ Horn function ⋮ Approximating Minimum Representations of Key Horn Functions ⋮ On functional dependencies in \(q\)-Horn theories
This page was built for publication: Horn minimization by iterative decomposition
