Weak consistency notions for all the CSPs of bounded width

DOI10.1145/2933575.2934510zbMath1401.68123arXiv1605.00565OpenAlexW2346597746MaRDI QIDQ4635924

Marcin Kozik

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00565

zbMATH Keywords

constraint satisfaction problemDataloglocal consistency checking algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (11)

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The smallest hard trees ⋮ The Complexity of Valued CSPs ⋮ Dismantlability, connectedness, and mixing in relational structures ⋮ On singleton arc consistency for CSPs defined by monotone patterns ⋮ Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs ⋮ Dismantlability, Connectedness, and Mixing in Relational Structures ⋮ Solving CSPs Using Weak Local Consistency

This page was built for publication: Weak consistency notions for all the CSPs of bounded width