Site menu:

Software

Instruction scheduling
tar.gz
README
An implementation of the constraint programming approach to superblock instruction scheduling for realistic multiple-issue processors described in:

    A. M. Malik, M. Chase, T. Russell, and P. van Beek. An application of constraint programming to superblock instruction scheduling. CP-2008.

Also available are benchmark instances.
tar.gz
README
An implementation of the constraint programming approach to local instruction scheduling for multiple-issue processors described in:

    A. M. Malik, J. McInnes, and P. van Beek. Optimal basic block instruction scheduling for multiple-issue processors using constraint programming. ICTAI-2006.

A bounds consistency propagator for the alldifferent constraint
tar.gz
README
An implementation of the algorithm for bounds consistency propagation of the alldifferent constraint presented in:

    A. Lopez-Ortiz, C.-G. Quimper, J. Tromp, and P. van Beek. A fast and simple algorithm for bounds consistency of the alldifferent constraint. IJCAI-2003.

Also included are some example benchmark and random problems that use the alldifferent constraint. Note:All of the code relies on the ILOG Solver Library.
A bounds consistency propagator for the generalized cardinality constraint
tar.gz
README
An implementation of the algorithm for bounds consistency propagation of the generalized cardinality constraint presented in:

    C.-G. Quimper, P. van Beek, A. Lopez-Ortiz, A. Golynski, and S.B. Sadjad. An efficient bounds consistency algorithm for the global cardinality constraint. CP-2003.

Also included are some example benchmark and random problems that use the alldifferent constraint. Note:All of the code relies on the ILOG Solver Library.
CPlan
tar.gz
README
CPlan solves planning problems formulated as constraint satisfaction problems.

    P. van Beek and X. Chen. CPlan: A constraint programming approach to planning. AAAI-1999.

Includes five case studies illustrating how the methodology and the planner can be used to solve planning problems in a new domain.
A `C' library of routines for solving binary constraint satisfaction problems
tar.gz
README
An extensive (but outdated) library of routines for experimenting with different backtracking methods for solving binary CSPs.