The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Hierarchical knowledge bases and efficient disjunctive reasoning
Proceedings of the first international conference on Principles of knowledge representation and reasoning
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Disjunctions of Horn Theories and Their Cores
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Propositional Lower Bounds: Generalization and Algorithms
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
On the diffvierence of horn theories
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Approximate Inference In Default Logic And Circumscription
Fundamenta Informaticae
Hi-index | 0.00 |
The problem of finding a set of assumptions which explain a given proposition is in general NP-hard, even when the background theory is an acyclic Horn theory. In this paper it is shown that when the background theory is acyclic Horn and its pseudo-completion ...