Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors

A backdoor in a finite-domain CSP instance is a set of variables where each possible instantiation moves the instance into a polynomial-time solvable class. Backdoors have found many applications in artificial intelligence and elsewhere, and the algorithmic problem of finding such backdoors has consequently been intensively studied. Sioutis and Janhunen (KI, 2019) have proposed a generalised backdoor concept suitable for infinite-domain CSP instances over binary constraints. We generalise their concept into a large class of CSPs that allow for higher-arity constraints. We show that this kind of infinite-domain backdoors have many of the positive computational properties that finite-domain backdoors have: the associated computational problems are fixed-parameter tractable whenever the underlying constraint language is finite. On the other hand, we show that infinite languages make the problems considerably harder. 2012 ACM Subject Classification Mathematics of computing → Discrete mathematics; Theory of computation → Complexity theory and logic

[1]  Arne Meier,et al.  Backdoors for Linear Temporal Logic , 2016, IPEC.

[2]  Dmitriy Zhuk,et al.  A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[3]  Sebastian Ordyniak,et al.  Backdoors to Planning , 2014, AAAI.

[4]  Peter Jonsson.  Constants and finite unary relations in qualitative constraint reasoning , 2018, Artif. Intell..

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

[6]  Andrei A. Bulatov,et al.  A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[7]  Manuel Bodirsky,et al.  RCC8 Is Polynomial on Networks of Bounded Treewidth , 2011, IJCAI.

[8]  Robin Hirsch,et al.  Relation Algebras of Intervals , 1996, Artif. Intell..

[9]  Jae Hee Lee,et al.  A Survey of Qualitative Spatial and Temporal Calculi , 2016, ACM Comput. Surv..

[10]  Stefan Szeider,et al.  Backdoor DNFs , 2021, IJCAI.

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

[12]  Marko Samer,et al.  Backdoor Sets of Quantified Boolean Formulas , 2008, Journal of Automated Reasoning.

[13]  Tomi Janhunen,et al.  Towards Leveraging Backdoors in Qualitative Constraint Networks , 2019, KI.

[14]  Stefan Szeider,et al.  Backdoor Sets for CSP , 2017, The Constraint Satisfaction Problem.

[15]  Toby Walsh,et al.  Backbones and Backdoors in Satisfiability , 2005, AAAI.

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

[17]  Robert Ganian,et al.  Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting , 2016, SODA.

[18]  Peter Jonsson,et al.  A Model-Theoretic View on Qualitative Constraint Reasoning , 2017, J. Artif. Intell. Res..

[19]  Peter Jonsson,et al.  An initial study of time complexity in infinite-domain constraint satisfaction , 2017, Artif. Intell..

[20]  Peter Jonsson,et al.  Why are CSPs Based on Partition Schemes Computationally Hard? , 2018, MFCS.

[21]  Marko Samer,et al.  Backdoor Trees , 2008, AAAI.

[22]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[23]  Martin C. Cooper,et al.  On Backdoors to Tractable Constraint Languages , 2014, CP.

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

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

[26]  Victor Lagerkvist,et al.  Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem , 2021, J. Comput. Syst. Sci..

[27]  Martha Sideri,et al.  The Inverse Satisfiability Problem , 1996, SIAM J. Comput..

[28]  Stefan Szeider,et al.  Backdoors into heterogeneous classes of SAT and CSP , 2017, J. Comput. Syst. Sci..

[29]  Manuel Bodirsky,et al.  The complexity of temporal constraint satisfaction problems , 2010, JACM.

[30]  Manuel Bodirsky,et al.  Complexity of Infinite-Domain Constraint Satisfaction , 2021 .

[31]  Jinbo Huang.  Compactness and Its Implications for Qualitative Spatial and Temporal Reasoning , 2012, KR.

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