The problem is modelled in such a way that every lecture was represented by a
variable, resource as a constraint and every possible location of an activity
in the time and space was represented by a single value. It means that a
value stands for a selection of the time (starting time slot), and one of the
available rooms. Binary dependencies are of course represented as constraints
This library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation; either version 3 of the
License, or (at your option) any later version.
This library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.