On the descriptive complexity of temporal constraint satisfaction problems

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Finite model theory and its applications.
Elements of finite model theory.
The complexity of equality constraint languages
Bounded width problems and algebras
Existence theorems for weakly symmetric operations
Affine systems of equations and counting infinitary logic
An optimal lower bound on the number of variables for graph identification
Universal graphs with forbidden subgraphs and algebraic closure
Conjunctive-query containment and constraint satisfaction
The wonderland of reflections
Expressive equivalence of least and inflationary fixed-point logic
Datalog and constraint satisfaction with infinite templates
Characterizations of several Maltsev conditions.
On digraph coloring problems and treewidth duality
A fast algorithm and datalog inexpressibility for temporal reasoning
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
Reducts of Ramsey structures
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Complexity of Infinite-Domain Constraint Satisfaction
On Random Ordering Constraints
OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT
Constraint Satisfaction with Countable Homogeneous Templates
On Datalog vs. LFP
Homomorphism preservation theorems
The complexity of temporal constraint satisfaction problems
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Reasoning about temporal relations
Homomorphism and embedding universal structures for restricted classes
RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC!
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
On polynomial time computation over unordered structures
On finite rigid structures
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures
MALTSEV CONDITIONS FOR GENERAL CONGRUENCE MEET-SEMIDISTRIBUTIVE ALGEBRAS
Algebraic Approach to Promise Constraint Satisfaction
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems
Tractability of quantified temporal constraints to the max
Definable inapproximability: new challenges for duplicator
Topological Birkhoff