Strong Backdoors for Default Logic

In this paper, we introduce a notion of backdoors to Reiter’s propositional default logic and study structural properties of it. Also we consider the problems of backdoor detection (parameterised by the solution size) as well as backdoor evaluation (parameterised by the size of the given backdoor), for various kinds of target classes (cnf, horn, krom, monotone, positive-unit). We show that backdoor detection is fixed-parameter tractable for the considered target classes, and backdoor evaluation is either fixed-parameter tractable, in \({\mathrm {para}}\text {-}\varDelta ^P_2\), or in \({\mathrm {para}}\text {-}\mathrm {NP}\), depending on the target class.

[1]  Stefan Szeider,et al.  On Fixed-Parameter Tractable Parameterizations of SAT , 2003, SAT.

[2]  Bart Selman,et al.  On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search , 2003 .

[3]  Georg Gottlob,et al.  Fixed-parameter complexity in AI and nonmonotonic reasoning , 1999, Artif. Intell..

[4]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[5]  Saul A. Kripke,et al.  Semantical Considerations on Modal Logic , 2012 .

[6]  Endre Boros,et al.  Recognition of q-Horn Formulae in Linear Time , 1994, Discret. Appl. Math..

[7]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[8]  Stefan Woltran,et al.  Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas , 2000, AAAI/IAAI.

[9]  Henning Fernau.  A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set , 2008, Algorithmica.

[10]  Marko Samer,et al.  Fixed-Parameter Tractability , 2021, Handbook of Satisfiability.

[11]  Stefan Szeider,et al.  Backdoors to Tractable Answer-Set Programming , 2011, IJCAI.

[12]  Stefan Szeider,et al.  Fixed-Parameter Tractable Reductions to SAT , 2014, SAT.

[13]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

[14]  Ge Xia,et al.  Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[15]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[16]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[17]  Zoltán Porkoláb,et al.  On the Complexity of Class , 2022 .

[18]  Arne Meier,et al.  The Complexity of Reasoning for Fragments of Autoepistemic Logic , 2010, TOCL.

[19]  C. P. Schnorr.  On self-transformable combinatorial problems , 1981 .

[20]  Stefan Rümmele,et al.  Backdoors to Abduction , 2013, IJCAI.

[21]  Endre Boros,et al.  Polynomial-time inference of all valid implications for Horn and related formulae , 1990, Annals of Mathematics and Artificial Intelligence.

[22]  Jörg Flum,et al.  Describing parameterized complexity classes , 2003, Inf. Comput..

[23]  Jonathan Stillman,et al.  It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics , 1990, AAAI.

[24]  Bart Selman,et al.  Backdoors To Typical Case Complexity , 2003, IJCAI.

[25]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[26]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

[27]  Daniël Paulusma,et al.  Satisfiability of acyclic and almost acyclic CNF formulas , 2011, Theor. Comput. Sci..

[28]  Georg Gottlob,et al.  Bounded treewidth as a key to tractability of knowledge representation and reasoning , 2006, Artif. Intell..

[29]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

[30]  Ge Xia,et al.  Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..

[31]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[32]  K FichteJohannes,et al.  Backdoors to Normality for Disjunctive Logic Programs , 2015 .

[33]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[34]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[35]  Arne Meier,et al.  On the parameterized complexity of non-monotonic logics , 2015, Archive for Mathematical Logic.

[36]  Georg Gottlob,et al.  The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic , 1997, FCT.

[37]  Riccardo Rosati.  Model Checking for Nonmonotonic Logics: Algorithms and Complexity , 1999, IJCAI.

[38]  Arne Meier,et al.  The complexity of propositional implication , 2008, Inf. Process. Lett..

[39]  Iyad A. Kanj,et al.  Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[40]  Stefan Szeider,et al.  Backdoors to Normality for Disjunctive Logic Programs , 2013, AAAI.

[41]  Stefan Szeider,et al.  Backdoors to Satisfaction , 2011, The Multivariate Algorithmic Revolution and Beyond.

[42]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[43]  Georg Gottlob,et al.  Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems , 2007, Comput. J..

[44]  Jonathan Stillman.  The complexity of Horn theories with normal unary defaults , 1990 .

[45]  Stefan Szeider,et al.  Augmenting Tractable Fragments of Abstract Argumentation , 2011, IJCAI.