Finite Relation Algebras with Normal Representations

One of the traditional applications of relation algebras is to provide a setting for infinite-domain constraint satisfaction problems. Complexity classification for these computational problems has been one of the major open research challenges of this application field. The past decade has brought significant progress on the theory of constraint satisfaction, both over finite and infinite domains. This progress has been achieved independently from the relation algebra approach. The present article translates the recent findings into the traditional relation algebra setting, and points out a series of open problems at the interface between model theory and the theory of relation algebras.

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

[2]  Jinbo Huang,et al.  Decomposition and tractability in qualitative spatial and temporal reasoning , 2013, Artif. Intell..

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

[4]  Barnaby Martin,et al.  Constraint satisfaction problems for reducts of homogeneous graphs , 2016, ICALP.

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

[6]  Wilfrid Hodges,et al.  A Shorter Model Theory , 1997 .

[7]  Peter Jonsson,et al.  The Complexity of Phylogeny Constraint Satisfaction Problems , 2015, ACM Trans. Comput. Log..

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

[9]  Barnaby Martin,et al.  On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction , 2010, LICS.

[10]  Roland Fraïssé.  Theory of relations , 1986 .

[11]  Michael Kompatscher,et al.  On the Update Operation in Skew Lattices , 2018, FLAP.

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

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

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

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

[16]  Manuel Bodirsky,et al.  Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[17]  Sai-Kee Yeung.  EFFECTIVE ESTIMATES ON THE VERY AMPLENESS OF THE CANONICAL LINE BUNDLE OF LOCALLY HERMITIAN SYMMETRIC SPACES , 2000 .

[18]  Manuel Bodirsky.  Cores of Countably Categorical Structures , 2007, Log. Methods Comput. Sci..

[19]  Manuel Bodirsky,et al.  A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP , 2018, LICS.

[20]  Manuel Bodirsky,et al.  Non-dichotomies in Constraint Satisfaction Complexity , 2008, ICALP.

[21]  R. Lyndon.  THE REPRESENTATION OF RELATIONAL ALGEBRAS , 1950 .

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

[23]  R. Fraïssé.  Sur l'extension aux relations de quelques propriétés des ordres , 1954 .

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

[25]  Libor Barto,et al.  The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[26]  Libor Barto,et al.  The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[27]  Arne Meier,et al.  Parametrised Complexity of Satisfiability in Temporal Logic , 2017, ACM Trans. Comput. Log..

[28]  Manuel Bodirsky,et al.  The complexity of temporal constraint satisfaction problems , 2008, STOC.

[29]  Manuel Bodirsky,et al.  Constraint satisfaction with infinite domains , 2004 .

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

[31]  Libor Barto,et al.  The wonderland of reflections , 2015, Israel Journal of Mathematics.

[32]  Manuel Bodirsky.  Constraint Satisfaction Problems with Infinite Templates , 2008, Complexity of Constraints.

[33]  Sanjiang Li,et al.  Combining binary constraint networks in qualitative reasoning , 2008, ECAI.

[34]  Friedrich Martin Schneider,et al.  A topological characterisation of endomorphism monoids of countable structures , 2015, 1508.07404.