Backdoors to Normality for Disjunctive Logic Programs

Johannes Klaus Fichte, Stefan Szeider

Over the last two decades, propositional satisfiability (SAT) has become one of the most successful and widely applied techniques for the solution of NP-complete problems. The aim…