Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/2991
Title: Timetabling in constraint logic programming
Authors: Kambi, M
Gilbert, D
Issue Date: 1996
Publisher: INAP
Citation: Proceedings of INAP-96: Symposium and Exhibition on Industrial Applications of Prolog, Tokyo, Japan, 16-19 October 1996.
Abstract: 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.
URI: http://bura.brunel.ac.uk/handle/2438/2991
Appears in Collections:Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
10.1.1.46.3415.pdf54.8 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.