Complexity classification transfer for CSPs via algebraic products

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Maintaining knowledge about temporal intervals
Orders on intervals over partially ordered sets: extending Allen's algebra and interval graph results.
Existence theorems for weakly symmetric operations
Quasi finitely axiomatizable totally categorical theories
Transitivity of permutation groups on unordered sets
Reasoning about partially ordered events
``Corner relations in Allen's algebra
A unifying approach to temporal constraint reasoning
On the algebraic structure of combinatorial problems
Allen-like theory of time for tree-like structures
The wonderland of reflections
Relation algebras and their application in temporal and spatial reasoning
Spatial reasoning about points in a multidimensional setting
Branching interval algebra: an almost complete picture
Description logics with concrete domains and general concept inclusions revisited
Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
Schaefer's Theorem for Graphs
A fast algorithm and datalog inexpressibility for temporal reasoning
A Model-Theoretic View on Qualitative Constraint Reasoning
The reducts of equality up to primitive positive interdefinability
Complexity of Infinite-Domain Constraint Satisfaction
Constraint Satisfaction with Countable Homogeneous Templates
Reasoning about temporal relations
Non-dichotomies in Constraint Satisfaction Complexity
The complexity of temporal constraint satisfaction problems
“Sometimes” and “not never” revisited
ℵ₀-categorical tree-decomposable structures
Total Ordering Problem
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Complexity and algorithms for reasoning about time
Expressive power and complexity in algebraic logic
Reasoning about temporal relations
Relations related to betweenness: their structure and automorphisms
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
A Dichotomy for First-Order Reducts of Unary Structures
Scheduling with AND/OR Precedence Constraints
Stability, the f.c.p., and superstability; model theoretic properties of formulas in first order theory
Tractability Results in the Block Algebra
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures
PROJECTIVE CLONE HOMOMORPHISMS
CORES OVER RAMSEY STRUCTURES
Ontology-Based Data Access
A Proof of the CSP Dichotomy Conjecture
Temporal Constraint Satisfaction Problems in Fixed-Point Logic
Tractability of quantified temporal constraints to the max
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs
A Guide to NIP Theories
Computer Science Logic
The Complexity of Phylogeny Constraint Satisfaction Problems
Decidability of Definability
Constraint Satisfaction, Logic and Forbidden Patterns
Topological Birkhoff
The mutual exclusion problem
Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
On the descriptive complexity of temporal constraint satisfaction problems

This page was built for publication: Complexity classification transfer for CSPs via algebraic products