The following pages link to Horn functions and their DNFs (Q1195858):
Displaying 18 items.
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Disjoint essential sets of implicates of a CQ Horn function (Q766268) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- The multiple facets of the canonical direct unit implicational basis (Q974107) (← links)
- Recognition of interval Boolean functions (Q1029585) (← links)
- Double Horn functions (Q1271644) (← links)
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation (Q1313951) (← links)
- Horn functions and submodular Boolean functions (Q1392203) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Recognition and dualization of disguised bidual Horn functions. (Q1853017) (← links)
- Properties of quasi-Boolean function on quasi-Boolean algebra (Q1937909) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- Generalized domination in closure systems (Q2489652) (← links)
- Horn representation of a concept lattice (Q3631392) (← links)
