On the descriptive complexity of temporal constraint satisfaction problems

Cites Work

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

Cited In (1)

Complexity classification transfer for CSPs via algebraic products

This page was built for publication: On the descriptive complexity of temporal constraint satisfaction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567262)