Pages that link to "Item:Q1936249"

The following pages link to Datalog and constraint satisfaction with infinite templates (Q1936249):

Displaying 21 items.

• Maximal infinite-valued constraint languages (Q1014639) (← links)
• Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
• Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
• ASNP: a tame fragment of existential second-order logic (Q2106601) (← links)
• On a stronger reconstruction notion for monoids and clones (Q2121508) (← links)
• Emptiness problems for distributed automata (Q2182732) (← links)
• Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
• The collapse of the bounded width hierarchy (Q2826031) (← links)
• The inference problem for template dependencies (Q3340200) (← links)
• A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
• (Q4643959) (← links)
• A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP (Q4957913) (← links)
• (Q5005145) (← links)
• Temporal Constraint Satisfaction Problems in Fixed-Point Logic (Q5145634) (← links)
• (Q5377468) (← links)
• Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
• The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)
• The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
• Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
• On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
• Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough (Q6654559) (← links)