AI Magazine
Information Processing Letters
Logical testing for rule-base management
Annals of Operations Research
Quadratic functions of binary variables
COMO '86 Lectures given at the third session of the Centro Internazionale Matematico Estivo (C.I.M.E.) on Combinatorial optimization
Comparison of expert system verification criteria: redundancy
Validation, verification and test of knowledge-based systems
MELODIA: logical methods for checking knowledge bases
Validation, verification and test of knowledge-based systems
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
Information Processing Letters
Learning Conjunctions of Horn Clauses
Machine Learning - Computational learning theory
Optimal compression of propositional Horn knowledge bases: complexity and approximation
Artificial Intelligence
Renaming a Set of Clauses as a Horn Set
Journal of the ACM (JACM)
Introduction to Expert Systems
Introduction to Expert Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On functional dependencies in q-Horn theories
Artificial Intelligence
Horn minimization by iterative decomposition
Annals of Mathematics and Artificial Intelligence
The Journal of Machine Learning Research
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
On approximate horn formula minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Disjoint essential sets of implicates of a CQ Horn function
Annals of Mathematics and Artificial Intelligence
Boolean functions with a simple certificate for CNF complexity
Discrete Applied Mathematics
Minimization for generalized Boolean formulas
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Boolean functions with long prime implicants
Information Processing Letters
A decomposition method for CNF minimality proofs
Theoretical Computer Science
On implicational bases of closure systems with unique critical sets
Discrete Applied Mathematics
| Hi-index | 0.00 |
Horn knowledge bases are widely used in many applications. This paper is concerned with the optimal compression of propositional Horn production rule bases - one of the most important knowledge bases used in practice. The problem of knowledge compression is interpreted as a problem of Boolean function minimization. It was proved in [16] that the minimization of Horn functions, i.e., Boolean functions associated with Horn knowledge bases, is NP-complete.This paper deals with the minimization of quasi-acyclic Horn functions, the class of which properly includes the two practically significant classes of quadratic and of acyclic functions. A procedure is developed for recognizing in quadratic time the quasi-acyclicity of a function given by a Horn CNF, and a graph-based algorithm is proposed for the quadratic time minimization of quasi-acyclic Horn functions.