A Model-Theoretic View on Qualitative Constraint Reasoning
From MaRDI portal
Publication:2974510
DOI10.1613/jair.5260zbMath1405.68342OpenAlexW2593619415MaRDI QIDQ2974510
Manuel Bodirsky, Peter Jonsson
Publication date: 10 April 2017
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.5260
Related Items (12)
Hardness of Network Satisfaction for Relation Algebras with Normal Representations ⋮ The smallest hard trees ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ Unnamed Item ⋮ General lower bounds and improved algorithms for infinite-domain CSPs ⋮ 𝜔-categorical structures avoiding height 1 identities ⋮ 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 ⋮ Computational Short Cuts in Infinite Domain Constraint Satisfaction ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
This page was built for publication: A Model-Theoretic View on Qualitative Constraint Reasoning
