On minimal constraint networks

In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter conjectured this computation problem to be 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 single constraint can be decomposed into an equivalent k-ary constraint network. We show that this holds even in case of bi-valued constraints where k>=3, which proves another conjecture of Dechter and Pearl. Finally, we establish the tractability frontier for this problem with respect to the domain cardinality and the parameter k.

[1]  Georg Gottlob,et al.  Hypertree width and related hypergraph invariants , 2007, Eur. J. Comb..

[2]  Christoph Koch,et al.  World-set decompositions: Expressiveness and efficient algorithms , 2007, Theor. Comput. Sci..

[3]  Francesca Rossi,et al.  Fundamental properties of networks of constraints: A new formulation , 1988 .

[4]  Tiziano Villa,et al.  Complexity of two-level logic minimization , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[6]  B. Tech,et al.  ALGORITHMIC COMPLEXITY OF SOME CONSTRAINT SATISFACTION PROBLEMS , 1995 .

[7]  David A. Cohen,et al.  Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems , 2005, CP.

[8]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[9]  Samson Abramsky,et al.  Relational Hidden Variables and Non-Locality , 2010, Studia Logica.

[10]  Bart Selman,et al.  A General Framework for Knowledge Compilation , 1991, PDK.

[11]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[12]  Markus Stumptner,et al.  Configuring Large Systems Using Generative Constraint Satisfaction , 1998, IEEE Intell. Syst..

[13]  Christophe Lecoutre,et al.  Constraint Networks: Techniques and Algorithms , 2009 .

[14]  Christian Bessiere,et al.  Constraint Propagation , 2006, Handbook of Constraint Programming.

[15]  Jakub Závodný,et al.  Factorised representations of query results: size bounds and readability , 2012, ICDT '12.

[16]  Knut Åkesson,et al.  Enumeration of Valid Partial Configurations , 2011, Configuration Workshop.

[17]  Mihalis Yannakakis,et al.  On the Complexity of Testing Implications of Functional and Join Dependencies , 1981, JACM.

[18]  Robert Rodosek,et al.  A New Approach on Solving 3-Satisfiability , 1996, AISMC.

[19]  Mihalis Yannakakis,et al.  Testing the Universal Instance Assumption , 1980, Inf. Process. Lett..

[20]  Martin Gebser,et al.  Conflict-Driven Answer Set Enumeration , 2007, LPNMR.

[21]  Marco Cadoli,et al.  A Survey on Knowledge Compilation , 1997, AI Commun..

[22]  Georg Gottlob,et al.  Hypertree Decompositions: A Survey , 2001, MFCS.

[23]  Rina Dechter,et al.  From Local to Global Consistency , 1990, Artif. Intell..

[24]  Georg Gottlob,et al.  On minimal constraint networks , 2011, Artif. Intell..

[25]  Marc Gyssens,et al.  Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..

[26]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[27]  Rina Dechter,et al.  Structure Identification in Relational Data , 1992, Artif. Intell..

[28]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[29]  Martin Gebser,et al.  Solution Enumeration for Projected Boolean Search Problems , 2009, CPAIOR.

[30]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.