Artificial Intelligence
Some results concerning the computational complexity of abduction
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)
The computational complexity of abduction
Artificial Intelligence - Special issue on knowledge representation
The complexity of logic-based abduction
Journal of the ACM (JACM)
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Support set selection for abductive and default reasoning
Artificial Intelligence
Semantics and complexity of abduction from default theories
Artificial Intelligence
Abduction from logic program: semantics and complexity
Theoretical Computer Science
A new method for consequence finding and compilation in restricted languages
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
On some tractable classes in deduction and abduction
Artificial Intelligence
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Using Compiled Knowledge to Guide and Focus Abductive Diagnosis
IEEE Transactions on Knowledge and Data Engineering
The Complexity of Restricted Consequence Finding and Abduction
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Preprocessing of intractable problems
Information and Computation
On computing all abductive explanations
Eighteenth national conference on Artificial intelligence
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A survey on knowledge compilation
AI Communications
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
New polynomial classes for logic-based abduction
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
What makes propositional abduction tractable
Artificial Intelligence
Prime Implicates and Reduced Implicate Tries
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Troubleshooting with human-readable automated reasoning
LISA'10 Proceedings of the 24th international conference on Large installation system administration
Hi-index | 0.00 |
Abduction is one of the most important forms of reasoning; it has been successfully applied to several practical problems, such as diagnosis. In this article we investigate whether the computational complexity of abduction can be reduced by an appropriate use of preprocessing. This is motivated by the fact that part of the data of the problem (namely, the set of all possible assumptions and the theory relating assumptions and manifestations) is often known before the rest of the problem. In this article, we show some complexity results about abduction when compilation is allowed.