Constraint Satisfaction Problems with Infinite Templates
From MaRDI portal
Publication:5504704
DOI10.1007/978-3-540-92800-3_8zbMath1171.03320OpenAlexW1534682606MaRDI QIDQ5504704
Publication date: 22 January 2009
Published in: Complexity of Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92800-3_8
Related Items (14)
The Power of Sherali--Adams Relaxations for General-Valued CSPs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Non-dichotomies in Constraint Satisfaction Complexity ⋮ The complexity of equality constraint languages ⋮ An initial study of time complexity in infinite-domain constraint satisfaction ⋮ \({\aleph_{0}}\)-categorical structures: endomorphisms and interpretations ⋮ Approximability of clausal constraints ⋮ A survey of homogeneous structures ⋮ Loop conditions for strongly connected digraphs ⋮ Topological Birkhoff ⋮ Peek arc consistency ⋮ Dualities for Constraint Satisfaction Problems ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Point algebras for temporal reasoning: Algorithms and complexity
- Dichotomies in the complexity of solving systems of equations over finite semigroups
- Oligomorphic clones
- A survey of clones on infinite sets
- Determining the consistency of partial tree descriptions
- \(\aleph _ 0\)-categorical, \(\aleph _ 0\)-stable structures
- Theory of relations. Transl. from the French by P. Clote
- On the complexity of H-coloring
- Linear unification
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- The complexity of infinite \(H\)-colouring
- A course in model theory. An introduction to contemporary mathematical logic. Transl. from the French by Moses Klein
- Relation algebras and their application in temporal and spatial reasoning
- Constraints, MMSNP and expander relational structures
- Closed systems of functions and predicates
- Categori city of denumerable atomless Boolean rings
- Building tractable disjunctive constraints
- The Complexity of Equality Constraint Languages
- Reasoning about temporal relations
- Structure of partially ordered sets with transitive automorphism groups
- Stable Finitely Homogeneous Structures
- ℵ0 -Categorical Structures Smoothly Approximated by Finite Substructures
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- On the Structure of Polynomial Time Reducibility
- `` Strong NP-Completeness Results
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Expressive power and complexity in algebraic logic
- Reasoning about temporal relations
- Acyclic Homomorphisms and Circular Colorings of Digraphs
- Classification of Infinite Primitive Jordan Permutation Groups
- Computer Science Logic
- Cores of Countably Categorical Structures
- Classifying the Complexity of Constraints Using Finite Algebras
- Tractability and Learnability Arising from Algebras with Few Subpowers
- Maximal Infinite-Valued Constraint Languages
- Datalog and Constraint Satisfaction with Infinite Templates
- A Simple Algorithm for Mal'tsev Constraints
- Reduced Products and Horn Classes
- Qualitative Temporal and Spatial Reasoning Revisited
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
This page was built for publication: Constraint Satisfaction Problems with Infinite Templates
