Horn approximations of empirical data
Artificial Intelligence
Tractable reasoning via approximation
Artificial Intelligence
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
On the hardness of approximate reasoning
Artificial Intelligence
Artificial Intelligence
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Computing intersections of Horn theories for reasoning with models
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On Horn Envelopes and Hypergraph Transversals
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
Semantical and computational aspects of horn approximations
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
An analysis of approximate knowledge compilation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
In this paper, we study issues on disjunctions of propositional Horn theories. In particular, we consider deciding whether a disjunction of Horn theories is Horn, and, if not, computing a Horn core, i.e., a maximal Horn theory included in this disjunction. The problems are investigated for different representations of Horn theories, namely for Horn CNFs and characteristic models. While the problems are shown to be intractable in general, we present polynomial time algorithms for bounded disjunctions in the formula-based case.