On generating all maximal independent sets
Information Processing Letters
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
ACM Transactions on Database Systems (TODS)
The complexity of logic-based abduction
Journal of the ACM (JACM)
Horn approximations of empirical data
Artificial Intelligence
Exact learning Boolean functions via the monotone theory
Information and Computation
Artificial Intelligence
Defaults and relevance in model-based reasoning
Artificial Intelligence - Special issue on relevance
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Combining Multiple Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Arbitration (or How to Merge Knowledge Bases)
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
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
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
Disjunctions of Horn Theories and Their Cores
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On the diffvierence of horn theories
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |
We consider computational issues in combining logical knowledge bases represented by their characteristic models; in particular, we study taking their logical intersection. We present efficient algorithms or prove intractability for the major computation problems for Horn knowledge bases. We also consider an extension of Horn theories, for which negative results are obtained. They indicate that generalizing the positive results beyond Hom theories is not immediate.