Temporal Constraint Satisfaction Problems in Fixed-Point Logic

Finite-domain constraint satisfaction problems are either solvable by Datalog, or not even expressible in fixed-point logic with counting. The border between the two regimes can be described by a strong height-one Maltsev condition. For infinite-domain CSPs, the situation is more complicated even if the template structure of the CSP is model-theoretically tame. We prove that there is no Maltsev condition that characterizes Datalog already for the CSPs of first-order reducts of (Q; <); such CSPs are called temporal CSPs and are of fundamental importance in infinite-domain constraint satisfaction. Our main result is a complete classification of temporal CSPs that can be expressed in one of the following logical formalisms: Datalog, fixed-point logic (with or without counting), or fixed-point logic with the Boolean rank operator. The classification shows that many of the equivalent conditions in the finite fail to capture expressibility in Datalog or fixed-point logic already for temporal CSPs.

[1]  MALTSEV CONDITIONS FOR GENERAL CONGRUENCE MEET-SEMIDISTRIBUTIVE ALGEBRAS , 2018, 1810.03178.

[2]  Michael Pinsker,et al.  Canonical Functions: a proof via topological dynamics , 2016, Contributions Discret. Math..

[3]  Michael Pinsker,et al.  Hrushovski's Encoding and ω-Categorical CSP Monsters , 2020, ICALP.

[4]  M. Olsák.  Generalizing CSP-related results to infinite algebras , 2019 .

[5]  Michael Pinsker,et al.  Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) , 2019, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[6]  Libor Barto,et al.  Equations in oligomorphic clones and the Constraint Satisfaction Problem for $ω$-categorical structures , 2016, J. Math. Log..

[7]  Erich Grädel,et al.  RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC! , 2015, The Journal of Symbolic Logic.

[8]  Pengming Wang,et al.  Descriptive complexity of constraint problems , 2018 .

[9]  Anuj Dawar,et al.  Definable Inapproximability: New Challenges for Duplicator , 2018, CSL.

[10]  Pengming Wang,et al.  Definability of semidefinite programming and lasserre lower bounds for CSPs , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

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

[12]  Martin Otto,et al.  Bounded Variable Logics and Counting: A Study in Finite Models , 1997, Lecture Notes in Logic.

[13]  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).

[14]  Jaroslav Nesetril,et al.  Homomorphism and Embedding Universal Structures for Restricted Classes , 2016, J. Multiple Valued Log. Soft Comput..

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

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

[17]  Anuj Dawar,et al.  The nature and power of fixed-point logic with counting , 2015, SIGL.

[18]  Anuj Dawar,et al.  Linear equation systems and the search for a logical characterisation of polynomial time , 2015 .

[19]  Manuel Bodirsky,et al.  Tractability of quantified temporal constraints to the max , 2014, Int. J. Algebra Comput..

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

[21]  Prasad Raghavendra,et al.  Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant , 2011, SIAM J. Comput..

[22]  Manuel Bodirsky,et al.  A fast algorithm and datalog inexpressibility for temporal reasoning , 2010, TOCL.

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

[24]  Michael Pinsker,et al.  Reducts of Ramsey structures , 2011, AMS-ASL Joint Special Session.

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

[26]  Andreas Goerdt.  On Random Ordering Constraints , 2009, CSR.

[27]  Anuj Dawar,et al.  Logics with Rank Operators , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[28]  M. Maróti,et al.  Existence theorems for weakly symmetric operations , 2008 .

[29]  Stephan Kreutzer,et al.  On Datalog vs. LFP , 2008, ICALP.

[30]  Martin Grohe,et al.  The Quest for a Logic Capturing PTIME , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[31]  Anuj Dawar,et al.  Affine Systems of Equations and Counting Infinitary Logic , 2007, ICALP.

[32]  Maarten Marx,et al.  Finite Model Theory and Its Applications , 2007, Texts in Theoretical Computer Science. An EATCS Series.

[33]  B. Larose,et al.  Bounded width problems and algebras , 2007 .

[34]  Manuel Bodirsky,et al.  The Complexity of Equality Constraint Languages , 2006, Theory of Computing Systems.

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

[36]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[37]  Jaroslav Nesetril,et al.  Constraint Satisfaction with Countable Homogeneous Templates , 2003, J. Log. Comput..

[38]  Tomás Feder,et al.  Homomorphism closed vs. existential positive , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[39]  V. Pestov,et al.  Fraïssé Limits, Ramsey Theory, and topological dynamics of automorphism groups , 2003, math/0305241.

[40]  Stephan Kreutzer.  Expressive equivalence of least and inflationary fixed-point logic , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[41]  Saharon Shelah,et al.  On polynomial time computation over unordered structures , 2001, Journal of Symbolic Logic.

[42]  S. Shelah,et al.  Universal Graphs with Forbidden Subgraphs and Algebraic Closure , 1998, math/9809202.

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

[44]  Martin Otto,et al.  Bounded Variable Logics and Counting , 1997 .

[45]  Saharon Shelah,et al.  On finite rigid structures , 1994, Journal of Symbolic Logic.

[46]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

[47]  Martin Otto,et al.  Inductive Definability with Counting on Finite Structures , 1992, CSL.

[48]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[49]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.

[50]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.