Backdoors into Heterogeneous Classes of SAT and CSP

Authors:
  • SGSerge Gaspers
    Serge Gaspers
  • NMNeeldhara Misra
    Neeldhara Misra
  • SOSebastian Ordyniak
    Sebastian Ordyniak
  • SSStefan Szeider
    Stefan Szeider
  • SŽStanislav Živný
    Stanislav Živný

Abstract
In this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor variables result in instances that belong to different base classes; the union of the base classes forms a heterogeneous base class. Backdoor sets to heterogeneous base classes can be much smaller than backdoor sets to homogeneous ones, hence they are much more desirable but possibly harder to find. We draw a detailed complexity landscape for the problem of detecting strong and weak backdoor sets into heterogeneous base classes for SAT and CSP.