Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough

Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Equational classes, universal algebra in model theory (03C05) Automorphisms and endomorphisms of algebraic structures (08A35) Descriptive complexity and finite models (68Q19)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
The complexity of equality constraint languages
Bounded width problems and algebras
Existence theorems for weakly symmetric operations
Conjunctive-query containment and constraint satisfaction
The wonderland of reflections
Datalog and constraint satisfaction with infinite templates
All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
Characterizations of several Maltsev conditions.
Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
Schaefer's theorem for graphs
The collapse of the bounded width hierarchy
Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
The reducts of equality up to primitive positive interdefinability
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Complexity of Infinite-Domain Constraint Satisfaction
Non-dichotomies in Constraint Satisfaction Complexity
A Subalgebra Intersection Property for Congruence Distributive Varieties
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Reasoning about temporal relations
Discrete Temporal Constraint Satisfaction Problems
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
Weak consistency notions for all the CSPs of bounded width
A Dichotomy for First-Order Reducts of Unary Structures
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures
Asking the Metaquestions in Constraint Tractability
PROJECTIVE CLONE HOMOMORPHISMS
Ontology-Based Data Access
A Proof of the CSP Dichotomy Conjecture
𝜔-categorical structures avoiding height 1 identities
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
Temporal Constraint Satisfaction Problems in Fixed-Point Logic
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width
Pseudo‐loop conditions
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs
Computer Science Logic
Cores of Countably Categorical Structures
Graph isomorphism in quasipolynomial time [extended abstract]
Fixed-point definability and polynomial time on graphs with excluded minors
Decidability of Definability
On the Power of k-Consistency
Dualities for Constraint Satisfaction Problems

This page was built for publication: Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough

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