Complexity classification transfer for CSPs via algebraic products
From MaRDI portal
Cites work
- “Sometimes” and “not never” revisited
- ``Corner relations in Allen's algebra
- A complexity dichotomy for poset constraint satisfaction
- A dichotomy for first-order reducts of unary structures
- A fast algorithm and Datalog inexpressibility for temporal reasoning
- A Guide to NIP Theories
- A model-theoretic view on qualitative constraint reasoning
- A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
- A proof of the CSP dichotomy conjecture
- A unifying approach to temporal constraint reasoning
- Allen-like theory of time for tree-like structures
- Branching interval algebra: an almost complete picture
- Canonical functions: a proof via topological dynamics
- Complexity and algorithms for reasoning about time
- Complexity of infinite-domain constraint satisfaction
- Computer Science Logic
- Constraint satisfaction problems for reducts of homogeneous graphs
- Constraint Satisfaction with Countable Homogeneous Templates
- Constraint Satisfaction, Logic and Forbidden Patterns
- CORES OVER RAMSEY STRUCTURES
- Decidability of definability
- Deciding the consistency of branching time interval networks
- Description logics with concrete domains and general concept inclusions revisited
- Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
- Existence theorems for weakly symmetric operations
- Expressive power and complexity in algebraic logic
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- scientific article; zbMATH DE number 5485512 (Why is no real title available?)
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- scientific article; zbMATH DE number 2044734 (Why is no real title available?)
- scientific article; zbMATH DE number 7199580 (Why is no real title available?)
- scientific article; zbMATH DE number 7760475 (Why is no real title available?)
- Maintaining knowledge about temporal intervals
- Non-dichotomies in Constraint Satisfaction Complexity
- On the algebraic structure of combinatorial problems
- On the descriptive complexity of temporal constraint satisfaction problems
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Orders on intervals over partially ordered sets: extending Allen's algebra and interval graph results.
- PROJECTIVE CLONE HOMOMORPHISMS
- Quasi finitely axiomatizable totally categorical theories
- Reasoning about partially ordered events
- Reasoning about temporal relations
- Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
- Relation algebras and their application in temporal and spatial reasoning
- Relations related to betweenness: their structure and automorphisms
- Scheduling with AND/OR Precedence Constraints
- Spatial reasoning about points in a multidimensional setting
- Stability, the f.c.p., and superstability; model theoretic properties of formulas in first order theory
- Temporal constraint satisfaction problems in fixed-point logic
- The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
- The complexity of phylogeny constraint satisfaction problems
- The complexity of temporal constraint satisfaction problems
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The mutual exclusion problem
- The reducts of equality up to primitive positive interdefinability
- The wonderland of reflections
- Topological Birkhoff
- Total Ordering Problem
- Tractability of quantified temporal constraints to the max
- Tractability Results in the Block Algebra
- Tractable combinations of temporal CSPs
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
- Transitivity of permutation groups on unordered sets
- ℵ0-categorical tree-decomposable structures
Cited in
(1)
This page was built for publication: Complexity classification transfer for CSPs via algebraic products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621744)
