×

zbMATH — the first resource for mathematics

Pruning for the minimum constraint family and for the number of distinct values constraint family. (English) Zbl 1067.68611
Walsh, Toby (ed.), Principles and practice of constraint programming - CP 2001. 7th international conference, Paphos, Cyprus, November 26 – December 1, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42863-1). Lect. Notes Comput. Sci. 2239, 211-224 (2001).
Summary: The paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One practical interest of the paper is to describe an implementation of the number of distinct values constraint. This is a quite common counting constraint that one encounters in many practical applications such as timetabling or frequency allocation problems. A second important contribution is to provide a pruning algorithm for the constraint “at most \(n\) distinct values for a set of variables”. This can be considered as the counterpart of Regin’s algorithm for the all different constraint where one enforces having at least \(n\) distinct values for a given set of \(n\) variables.
For the entire collection see [Zbl 0984.00059].

MSC:
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
PDF BibTeX XML Cite
Full Text: Link