Polynomially solvable satisfiability problems
Information Processing Letters
Information Processing Letters
The design of relational databases
The design of relational databases
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
Information Processing Letters
On generalized Horn formulas and k-resolution
Theoretical Computer Science
Optimal compression of propositional Horn knowledge bases: complexity and approximation
Artificial Intelligence
A Complexity Index for Satisfiability Problems
SIAM Journal on Computing
Algorithms for inferring functional dependencies from relations
Data & Knowledge Engineering
Recognition of q-Horn formulae in linear time
Discrete Applied Mathematics
Horn approximations of empirical data
Artificial Intelligence
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Essential and redundant rules in Horn knowledge bases
Decision Support Systems
Artificial Intelligence
Functional dependencies in Horn theories
Artificial Intelligence
Renaming a Set of Clauses as a Horn Set
Journal of the ACM (JACM)
A short note on some tractable cases of the satisfiability problem
Information and Computation
Equational characterizations of Boolean function classes
Discrete Mathematics
Investigations on autark assignments
Discrete Applied Mathematics - Special issue on Boolean functions and related problems
Horn minimization by iterative decomposition
Annals of Mathematics and Artificial Intelligence
Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression
IEEE Transactions on Knowledge and Data Engineering
On Horn Envelopes and Hypergraph Transversals
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Theory of Relational Databases
Theory of Relational Databases
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Artificial Intelligence
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
This paper studies functional dependencies in q-Horn theories, and discusses their use in knowledge condensation. We introduce compact model-based representations of q-Horn theories, analyze the structure of functional dependencies in q-Horn theories, and show that every minimal functional dependency in a q-Horn theory Σ can be expressed either by a single term or by a single clause. We also prove that the set of all minimal functional dependencies in Σ is quasi-acyclic. We then develop polynomial time algorithms for recognizing whether a given functional dependency holds in a q-Horn theory, which is represented either by a q-Horn CNF or as the q-Horn envelope of a set of models. Finally, we show that every q-Horn theory has a unique condensation, and can be condensed in polynomial time.