On the descriptive complexity of temporal constraint satisfaction problems
From MaRDI portal
Publication:6567262
Recommendations
- Temporal constraint satisfaction problems in fixed-point logic
- Datalog and Constraint Satisfaction with Infinite Templates
- The complexity of temporal constraint satisfaction problems
- Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates
- Datalog and constraint satisfaction with infinite templates
Cites work
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 515737 (Why is no real title available?)
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- scientific article; zbMATH DE number 7406819 (Why is no real title available?)
- scientific article; zbMATH DE number 7536113 (Why is no real title available?)
- A fast algorithm and Datalog inexpressibility for temporal reasoning
- A finite-model-theoretic view on propositional proof complexity
- Affine systems of equations and counting infinitary logic
- Algebraic Approach to Promise Constraint Satisfaction
- An optimal lower bound on the number of variables for graph identification
- Beating the random ordering is hard: every ordering CSP is approximation resistant
- Bounded width problems and algebras
- Characterizations of several Maltsev conditions.
- Complexity of infinite-domain constraint satisfaction
- Conjunctive-query containment and constraint satisfaction
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- Constraint Satisfaction with Countable Homogeneous Templates
- Datalog and constraint satisfaction with infinite templates
- Definability of semidefinite programming and Lasserre lower bounds for CSPs
- Definable inapproximability: new challenges for duplicator
- Elements of finite model theory.
- Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
- Existence theorems for weakly symmetric operations
- Expressive equivalence of least and inflationary fixed-point logic
- Finite model theory and its applications.
- Homomorphism and embedding universal structures for restricted classes
- Homomorphism preservation theorems
- Maltsev conditions for general congruence meet-semidistributive algebras
- OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT
- On Datalog vs. LFP
- On Random Ordering Constraints
- On digraph coloring problems and treewidth duality
- On finite rigid structures
- On polynomial time computation over unordered structures
- Rank logic is dead, long live rank logic!
- Reasoning about temporal relations
- Reducts of Ramsey structures
- Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The complexity of equality constraint languages
- The complexity of temporal constraint satisfaction problems
- The wonderland of reflections
- Topological Birkhoff
- Tractability of quantified temporal constraints to the max
- Universal graphs with forbidden subgraphs and algebraic closure
- When symmetries are not enough: a hierarchy of hard constraint satisfaction problems
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)
