“…This approach has been highly successful: applications can be found in e.g. (quantified) propositional satisfiability (Samer & Szeider, 2009a, 2009b, abductive reasoning (Pfandler, Rümmele, & Szeider, 2013), argumentation (Dvorák, Ordyniak, & Szeider, 2012), planning (Kronegger, Ordyniak, & Pfandler, 2019), logic (Meier, Ordyniak, Ramanujan, & Schindler, 2019), and answer set programming (Fichte & Szeider, 2015). Williams et al (2003) argue that backdoors may explain why SAT solvers occasionally fail to solve randomly generated instances with only a handful of variables but succeed in solving real-world instances containing thousands of variables.…”