Minimal representation of directed hypergraphs
SIAM Journal on Computing
Unification as a complexity measure for logic programming
Journal of Logic Programming
Information Processing Letters
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
Information Processing Letters
Optimal compression of propositional Horn knowledge bases: complexity and approximation
Artificial Intelligence
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression
IEEE Transactions on Knowledge and Data Engineering
On functional dependencies in q-Horn theories
Artificial Intelligence
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
Exclusive and essential sets of implicates of Boolean functions
Discrete Applied Mathematics
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence
Disjoint essential sets of implicates of a CQ Horn function
Annals of Mathematics and Artificial Intelligence
Boolean functions with long prime implicants
Information Processing Letters
A decomposition method for CNF minimality proofs
Theoretical Computer Science
Hi-index | 0.00 |
Given a Horn CNF representing a Boolean function f, the problem of Horn minimization consists in constructing a CNF representation of f which has a minimum possible number of clauses. This problem is the formalization of the problem of knowledge compression for speeding up queries to propositional Horn expert systems, and it is known to be NP‐hard. In this paper we present a linear time algorithm which takes a Horn CNF as an input, and through a series of decompositions reduces the minimization of the input CNF to the minimization problem on a “shorter” CNF. The correctness of this decomposition algorithm rests on several interesting properties of Horn functions which, as we prove here, turn out to be independent of the particular CNF representations.