References
- [1]
-
Nicolas Barnier and Pascal Brisset.
FaCiLe: a functional constraint library.
ALP Newsletter, 14(2), may 2001.
- [2]
-
Noelle Bleuzen Guernalec and Alain Colmerauer.
Narrowing a 2n-block of sorting in O(nlogn).
In Principles and Practice of Constraint Programming.
Springer-Verlag, 1997.
- [3]
-
J. Hopcroft and R. Karp.
An n5/2 algorithm for maximum matching in bipartite graphs.
SIAM Journal of Computing, 2(4):225--231, 1973.
- [4]
-
Serge Le Huitouze.
A new data structure for implementing extensions to Prolog.
In P. Deransart and J. Mauszynski, editors, 2nd Int.
Work. Programming Languages Implementation and Logic Programming, LNCS 456,
pages 136--150. Springer-Verlag, 1990.
- [5]
-
Xavier Leroy.
The Objective Caml System: User's and reference manual (http://caml.inria.fr), 2000.
- [6]
-
Jean-Charles Régin.
Generalized arc consistency for global cardinality constraint.
In Proceedings of the Thirteenth National Conference on
Artificial Intelligence, 1996.