[Back]

J. Fichte:
"The Good, the Bad, and the Odd: Cycles in Answer-Set Programs";
in: "New Directions in Logic, Language and Computation", D. Lassiter, M. Slavkovik (ed.); Springer LNCS, Springer Berlin / Heidelberg, 2012, ISBN: 978-3-642-31466-7, 78 - 90.

Backdoors of answer-set programs are sets of atoms that represent "clever reasoning shortcuts" through the search space. Assignments to backdoor atoms reduce the given program to several programs that belong to a tractable target class. Previous research has considered target classes based on notions of acyclicity where various types of cycles (good and bad cycles) are excluded from graph representations of programs. We generalize the target classes by taking the parity of the number of negative edges on bad cycles into account and consider backdoors for such classes. We establish new hardness results and non-uniform polynomial-time tractability relative to directed or undirected cycles.

http://dx.doi.org/10.1007/978-3-642-31467-4_6

Project Head Stefan Szeider:
The Parameterized Complexity of Reasoning Problems