On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns

Singleton arc consistency is an important type of local consistency which has been recently shown to solve all constraint satisfaction problems (CSPs) over constraint languages of bounded width. We aim to characterise all classes of CSPs defined by a forbidden pattern that are solved by singleton arc consistency and closed under removing constraints. We identify five new patterns whose absence ensures solvability by singleton arc consistency, four of which are provably maximal and three of which generalise 2-SAT. Combined with simple counter-examples for other patterns, we make significant progress towards a complete classification.

[1]  Dániel Marx,et al.  Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries , 2009, JACM.

[2]  Libor Barto,et al.  Constraint Satisfaction Problems Solvable by Local Consistency Methods , 2014, JACM.

[3]  Roland H. C. Yap,et al.  An optimal coarse-grained arc consistency algorithm , 2005, Artif. Intell..

[4]  Martin C. Cooper,et al.  Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns , 2015, Discret. Appl. Math..

[5]  Hubie Chen,et al.  Arc consistency and friends , 2011, J. Log. Comput..

[6]  Andrei A. Bulatov,et al.  A Simple Algorithm for Mal'tsev Constraints , 2006, SIAM J. Comput..

[7]  Martin C. Cooper,et al.  Variable and value elimination in binary constraint satisfaction via forbidden patterns , 2015, J. Comput. Syst. Sci..

[8]  Peter Jeavons,et al.  Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..

[9]  Christian Bessiere,et al.  Theoretical analysis of singleton arc consistency and its extensions , 2008, Artif. Intell..

[10]  Martin C. Cooper,et al.  Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems , 2016, Artif. Intell..

[11]  Shikharesh Majumdar,et al.  A Constraint Programming-Based Resource Management Technique for Processing MapReduce Jobs with SLAs on Clouds , 2014, 2014 43rd International Conference on Parallel Processing.

[12]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[13]  Cemalettin Ozturk,et al.  Optimisation and Constraint Based Heuristic Methods for Advanced Planning and Scheduling Systems , 2016 .

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

[15]  Eugene C. Freuder.  Eliminating Interchangeable Values in Constraint Satisfaction Problems , 1991, AAAI.

[16]  Martin C. Cooper,et al.  Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination , 2010, Artif. Intell..

[17]  Pawel M. Idziak,et al.  Tractability and Learnability Arising from Algebras with Few Subpowers , 2010, SIAM J. Comput..

[18]  Martin C. Cooper,et al.  Characterising Tractable Constraints , 1994, Artif. Intell..

[19]  Martin C. Cooper,et al.  Hybrid tractability of valued constraint problems , 2010, Artif. Intell..

[20]  Andrei A. Bulatov.  Graphs of relational structures: restricted types , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[21]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[22]  Stephen F. Smith,et al.  Applying constraint satisfaction techniques to job shop scheduling , 1997, Ann. Oper. Res..

[23]  R. McKenzie,et al.  Varieties with few subalgebras of powers , 2009 .

[24]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[25]  Chris N. Potts,et al.  Constraint satisfaction problems: Algorithms and applications , 1999, Eur. J. Oper. Res..

[26]  Marcin Kozik.  Weak consistency notions for all the CSPs of bounded width∗ , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[27]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.