The complexity of logic-based abduction
Journal of the ACM (JACM)
The resolution calculus
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Describing parameterized complexity classes
Information and Computation
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
What makes propositional abduction tractable
Artificial Intelligence
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
Computing Stable Models via Reductions to Difference Logic
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Improved upper bounds for vertex cover
Theoretical Computer Science
Abductive and default reasoning: a computational core
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Empirical study of the anatomy of modern sat solvers
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence
Backdoors to tractable answer-set programming
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
The Multivariate Algorithmic Revolution and Beyond
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized Complexity
Hi-index | 0.00 |
Abductive reasoning (or Abduction, for short) is among the most fundamental AI reasoning methods, with a broad range of applications, including fault diagnosis, belief revision, and automated planning. Unfortunately, Abduction is of high computational complexity; even propositional Abduction is Σ2P-complete and thus harder than NP and co-NP. This complexity barrier rules out the existence of a polynomial transformation to propositional satisfiability (SAT). In this work we use structural properties of the Abduction instance to break this complexity barrier. We utilize the problem structure in terms of small backdoor sets. We present fixed-parameter tractable transformations from Abduction to SAT, which make the power of today's SAT solvers available to Abduction.