In this paper we describe the timetabling problem and its solvability in a Constraint Logic
Programming Language. A solution to the problem has been developed and implemented in
ECLiPSe, since it deals with finite domains, it has well-defined interfaces between basic
building blocks and supports good debugging facilities. The implemented timetable was
based on the existing, currently used, timetables at the School of Informatics at out
university. It integrates constraints concerning room and period availability
