Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Backdoors to Abduction   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
\Sigma_2^P-complete and thus harder than NP and coNP. 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.

26
The categories of this paper are: bayes-an
35
The categories of this paper are: mtrl-th
5
The categories of this paper are: gr-qc
14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
23
The categories of this paper are: solv-int
30
The categories of this paper are: q-alg
21
The categories of this paper are: adap-org
18
The categories of this paper are: econ
32
The categories of this paper are: atom-ph
12
The categories of this paper are: nucl-th
9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol
31
The categories of this paper are: ao-sci
2
The categories of this paper are: math