Temporal Constraint Satisfaction Problems in Fixed-Point Logic

02/21/2020
by   Manuel Bodirsky, et al.
0

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 coincides with an important dichotomy in universal algebra; in particular, the border 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 characterises 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 solved in Datalog, and that can be solved in fixed point logic (with or without counting); the classification shows that many of the equivalent conditions in the finite fail to capture expressibility in any of these formalisms already for temporal CSPs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/12/2021

Separating LREC from LFP

LREC= is an extension of first-order logic with a logarithmic recursion ...
research
09/11/2019

Promises Make Finite (Constraint Satisfaction) Problems Infinitary

The fixed template Promise Constraint Satisfaction Problem (PCSP) is a r...
research
01/14/2019

Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems)

The algebraic dichotomy conjecture for Constraint Satisfaction Problems ...
research
01/14/2019

Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)

The algebraic dichotomy conjecture for Constraint Satisfaction Problems ...
research
04/09/2021

Inapproximability of Unique Games in Fixed-Point Logic with Counting

We study the extent to which it is possible to approximate the optimal v...
research
08/03/2020

Approximating Constraint Satisfaction Problems Symmetrically

This thesis investigates the extent to which the optimal value of a cons...
research
08/07/2023

Quantifiers closed under partial polymorphisms

We study Lindstrom quantifiers that satisfy certain closure properties w...

Please sign up or login with your details

Forgot password? Click here to reset