Network Satisfaction Problems Solved by k-Consistency

We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some natural number k, is undecidable. For the important class of finite relation algebras A with a normal representation, however, the decidability of this problem remains open. We show that if A is symmetric and has a flexible atom, then the question whether NSP(A) can be solved by k-consistency, for some natural number k, is decidable (even in polynomial time in the number of atoms of A). This result follows from a more general sufficient condition for the correctness of the k-consistency procedure for finite symmetric relation algebras. In our proof we make use of a result of Alexandr Kazda about finite binary conservative structures.

[1]  M. Bodirsky,et al.  The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom , 2020, J. Artif. Intell. Res..

[2]  Manuel Bodirsky,et al.  Network satisfaction for symmetric relation algebras with a flexible atom , 2020, AAAI.

[3]  M. Bodirsky,et al.  Hardness of Network Satisfaction for Relation Algebras with Normal Representations , 2019, RAMiCS.

[4]  Manuel Bodirsky,et al.  Finite Relation Algebras with Normal Representations , 2018, RAMiCS.

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

[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]  Peter Jonsson,et al.  A Model-Theoretic View on Qualitative Constraint Reasoning , 2017, J. Artif. Intell. Res..

[8]  Hubie Chen,et al.  Asking the Metaquestions in Constraint Tractability , 2016, TOCT.

[9]  Manuel Bodirsky,et al.  A Dichotomy for First-Order Reducts of Unary Structures , 2016, Log. Methods Comput. Sci..

[10]  R. Willard,et al.  Characterizations of several Maltsev conditions , 2015 .

[11]  Andrei A. Bulatov,et al.  Conservative constraint satisfaction re-revisited , 2014, J. Comput. Syst. Sci..

[12]  Manuel Bodirsky,et al.  Complexity Classification in Infinite-Domain Constraint Satisfaction , 2012, ArXiv.

[13]  Alexandr Kazda,et al.  CSP for binary conservative relational structures , 2011, 1112.1099.

[14]  Andrei A. Bulatov,et al.  Complexity of conservative constraint satisfaction problems , 2011, TOCL.

[15]  Libor Barto,et al.  The Dichotomy for Conservative Constraint Satisfaction Problems Revisited , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[16]  Libor Barto,et al.  Constraint Satisfaction Problems of Bounded Width , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[17]  Roger D. Maddux,et al.  Chromatic Graphs, Ramsey Numbers and the Flexible Atom Conjecture , 2008, Electron. J. Comb..

[18]  Andrei A. Bulatov,et al.  On the Power of k -Consistency , 2007, ICALP.

[19]  Manuel Bodirsky,et al.  Datalog and constraint satisfaction with infinite templates , 2006, J. Comput. Syst. Sci..

[20]  Ivo Düntsch,et al.  Relation Algebras and their Application in Temporal and Spatial Reasoning , 2005, Artificial Intelligence Review.

[21]  Matteo Cristani,et al.  The complexity of constraint satisfaction problems for small relation algebras , 2004, Artif. Intell..

[22]  Andrei A. Bulatov,et al.  Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[23]  I. Hodkinson,et al.  Relation Algebras by Games , 2002 .

[24]  Robin Hirsch,et al.  Strongly representable atom structures of relation algebras , 2001 .

[25]  Robin Hirsch,et al.  A Finite Relation Algebra with Undecidable Network Satisfaction Problem , 1999, Log. J. IGPL.

[26]  Robin Hirsch,et al.  Representability is not decidable for finite relation algebras , 1999 .

[27]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[28]  Robin Hirsch,et al.  Expressive Power and Complexity in Algebraic Logic , 1997, J. Log. Comput..

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

[30]  Roger D. Maddux,et al.  A perspective on the theory of relation algebras , 1994 .

[31]  R. McKenzie.  Representations of integral relation algebras. , 1970 .

[32]  D. Geiger.  CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES , 1968 .

[33]  C. J. Everett,et al.  The Representation of Relational Algebras. , 1951 .

[34]  E. Hannum.  "PROOF" , 1934, Francis W. Parker School Studies in Education.

[35]  Michael Pinsker,et al.  Smooth Approximations and Relational Width Collapses , 2021, ICALP.

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

[37]  Bernhard Nebel,et al.  Qualitative Spatial Reasoning Using Constraint Calculi , 2007, Handbook of Spatial Logics.

[38]  J. P. Andersen.  The Representation of Relation Algebras , 1961 .