Constraint Satisfaction with Countable Homogeneous Templates
\(\omega\)-categorical structureageclone of polymorphismscomputational complexityconstraint satisfaction problemcountable homogeneous digraphcountable homogeneous relational structureNP-completepolymorphism preservation theorem
Equational classes, universal algebra in model theory (03C05) Categoricity and completeness of theories (03C35) Properties of classes of models (03C52) Complexity of computation (including implicit computational complexity) (03D15) Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
- Maximal infinite-valued constraint languages
- Determining the consistency of partial tree descriptions
- Polymorphism clones of homogeneous structures: gate coverings and automatic homeomorphicity
- The wonderland of reflections
- Minimal functions on the random graph
- Permutation groups with small orbit growth
- Tractable combinations of theories via sampling
- Using model theory to find decidable and tractable description logics with concrete domains
- Description logics with concrete domains and general concept inclusions revisited
- On a stronger reconstruction notion for monoids and clones
- Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting)
- On polymorphism-homogeneous relational structures and their clones.
- A survey of homogeneous structures
- Permutation monoids and MB-homogeneity for graphs and relational structures
- Reconstructing the topology of clones
- Countable 1-transitive trees
- Equivariant algorithms for constraint satisfaction problems over coset templates
- Constraint satisfaction problems over the integers with successor
- Constraint satisfaction problems for reducts of homogeneous graphs
- Action of endomorphism semigroups on definable sets
- Equivalence constraint satisfaction problems
- Parameterized complexity of the workflow satisfiability problem
- A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
- Constraint satisfaction with counting quantifiers. II
- Quantified Constraints in Twenty Seventeen
- Tractable combinations of temporal CSPs
- Hardness of Network Satisfaction for Relation Algebras with Normal Representations
- scientific article; zbMATH DE number 7199580 (Why is no real title available?)
- \( \omega \)-categorical structures avoiding height 1 identities
- Solving equation systems in ω-categorical algebras
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
- Constraint satisfaction problems for reducts of homogeneous graphs
- Computer Science Logic
- \({\aleph_{0}}\)-categorical structures: endomorphisms and interpretations
- Positive primitive structures
- Topological Birkhoff
- Introduction to the Maximum Solution Problem
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
- More sublattices of the lattice of local clones
- On the descriptive complexity of temporal constraint satisfaction problems
- Complexity classification transfer for CSPs via algebraic products
- Smooth approximations and CSPs over finitely bounded homogeneous structures
- Canonical polymorphisms of Ramsey structures and the unique interpolation property
- Forbidden tournaments and the orientation completion problem
- Smooth approximations: an algebraic approach to CSPs over finitely bounded homogeneous structures
- Datalog-expressibility for monadic and guarded second-order logic
- Three fundamental questions in modern infinite-domain constraint satisfaction
- In praise of homomorphisms
- A new line of attack on the dichotomy conjecture
- The complexity of equality constraint languages
This page was built for publication: Constraint Satisfaction with Countable Homogeneous Templates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3430949)
