Efficient algorithms for constraint description problems over finite totally ordered domains: Extended abstract

Angel Gil (1) , Miki Hermann (2) , Gernot Salzer (3) , Bruno Zanuttini (4)

1 UPF - Universitat Pompeu Fabra [Barcelona]
2 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
3 Institut für Computersprachen
4 Equipe MAD - Laboratoire GREYC - UMR6072

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 Hébrard and Zanuttini. They also complete the results of Hähnle et al. on multi-valued 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.

Domaines: Intelligence artificielle [cs.AI]

Angel Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini. Efficient algorithms for constraint description problems over finite totally ordered domains: Extended abstract. 2nd International Joint Conference on Automated Reasoning (IJCAR 2004), 2004, France. pp.244--258. ⟨hal-00995235⟩