Datalog and constraint satisfaction with infinite templates
From MaRDI portal
Publication:1936249
DOI10.1016/j.jcss.2012.05.012zbMath1263.68051OpenAlexW2949165194MaRDI QIDQ1936249
Manuel Bodirsky, Victor Dalmau
Publication date: 21 February 2013
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2012.05.012
computational complexityconstraint satisfactionDataloglogic in computer sciencecountably categorical structures
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (15)
On a stronger reconstruction notion for monoids and clones ⋮ Emptiness problems for distributed automata ⋮ The algebraic structure of the densification and the sparsification tasks for CSPs ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ Unnamed Item ⋮ Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms ⋮ Constants and finite unary relations in qualitative constraint reasoning ⋮ A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP ⋮ Unnamed Item ⋮ A Dichotomy for First-Order Reducts of Unary Structures ⋮ Dualities for Constraint Satisfaction Problems ⋮ Using model theory to find decidable and tractable description logics with concrete domains ⋮ ASNP: a tame fragment of existential second-order logic ⋮ Unnamed Item ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
Uses Software
This page was built for publication: Datalog and constraint satisfaction with infinite templates
