In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. It was conjectured that computing a solution to such a network is NP hard. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k ≥ 2 it is NP-hard to decide whether a constraint network can be decomposed into an equivalent k-ary constraint network, and study related questions. © 2011 Springer-Verlag.
CITATION STYLE
Gottlob, G. (2011). On minimal constraint networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6876 LNCS, pp. 325–339). https://doi.org/10.1007/978-3-642-23786-7_26
Mendeley helps you to discover research relevant for your work.