Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract

Given a finite set of vectors over a finite totally ordered domain, we study the problem of computing a constraint in conjunctive normal form such that the set of solutions for the produced constraint is identical to the original set. We develop an efficient polynomial-time algorithm for the general case, followed by specific polynomial-time algorithms producing Horn, dual Horn, and bijunctive constraints for sets of vectors closed under the operations of conjunction, disjunction, and median, respectively. We also consider the affine constraints, analyzing them by means of computer algebra. Our results generalize the work of Dechter and Pearl on relational data, as well as the papers by Hebrard and Zanuttini. They also complete the results of Hahnle et al. on multivalued logics and Jeavons et al. on the algebraic approach to constraints. We view our work as a step toward a complete complexity classification of constraint satisfaction problems over finite domains.

[1]  Carlos Ansótegui,et al.  New logical and complexity results for Signed-SAT , 2003, 33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings..

[2]  Bernhard Beckert,et al.  The 2-SAT problem of regular signed CNF formulas , 2000, Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000).

[3]  Reiner Hähnle,et al.  Complexity of Many-Valued Logics. , 2001 .

[4]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraints on a three-element set , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[5]  Martin C. Cooper,et al.  Characterising Tractable Constraints , 1994, Artif. Intell..

[6]  Reiner Hähnle,et al.  A modular reduction of regular logic to classical logic , 2001, Proceedings 31st IEEE International Symposium on Multiple-Valued Logic.

[7]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[8]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[9]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[10]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[11]  Reiner Hähnle.  Exploiting Data Dependencies in Many-Valued Logics , 1996, J. Appl. Non Class. Logics.

[12]  Martin C. Cooper,et al.  Tractable Constraints on Ordered Domains , 1995, Artif. Intell..

[13]  Bruno Zanuttini,et al.  A unified framework for structure identification , 2002, Inf. Process. Lett..

[14]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[15]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[16]  Reiner Hähnle,et al.  Advanced Many-Valued Logics , 2001 .

[17]  Jaroslav Nesetril,et al.  On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

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

[19]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[20]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[21]  Bruno Zanuttini,et al.  An efficient algorithm for Horn description , 2003, Inf. Process. Lett..