Constraint satisfaction tractability from semi-lattice operations on infinite sets
From MaRDI portal
Publication:2946719
DOI10.1145/2528933zbMath1354.68109arXiv1111.6616OpenAlexW2072543642WikidataQ61848353 ScholiaQ61848353MaRDI QIDQ2946719
Manuel Bodirsky, Johan Thapper, H. D. Macpherson
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.6616
computational complexityconstraint satisfaction problems\(\omega\)-categoricitysemilattice operations
Related Items (4)
Non-local configuration of component interfaces by constraint satisfaction ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ Tractable combinations of theories via sampling ⋮ Distance constraint satisfaction problems
This page was built for publication: Constraint satisfaction tractability from semi-lattice operations on infinite sets