3 Self-organisation for the School Timetabling Problem An example of a classical constraint-satisfaction problem (CSP) is the school timetabling problem in which a timetable for a certain duration must be found while respecting the explicit constraints (availability, specialisation, equipment needed .

Computer scientists can translate such constraint-satisfaction problems into symbolic logic, where each variable is either true or false.