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. © Springer-Verlag Berlin Heidelberg 1998.
CITATION STYLE
Eiter, T., Ibaraki, T., & Makino, K. (1998). Disjunctions of horn theories and their cores. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1533 LNCS, pp. 49–60). Springer Verlag. https://doi.org/10.1007/3-540-49381-6_7
Mendeley helps you to discover research relevant for your work.