Declarative configuration applied to course scheduling
Name
84842561-MIT.pdf
Description
Full printable version
Size
3.11 MB
Format
Adobe PDF
Checksum (MD5)
cfd6dd0aaab6c26489a31bcd92054a24
Author(s)
Yeung, Vincent S. (Vincent Shu Hang)
Advisor(s)
Daniel Jackson.
Date Issued
2006
Publisher
Massachusetts Institute of Technology
Abstract
This thesis describes a course scheduling system that models planning as a satisfiability problem in relational logic. Given a set of course requirements for a degree program, our system can find a schedule of courses that will complete these requirements. It supports a flexible XML format for expressing course requirements and also handles additional user-specific constraints, such as requirements that certain courses be taken at particular times. Various optimizations were included in the translation to relational logic to improve the performance of our system and the quality of its results. We ran experiments on our system using degree programs from the Department of Electrical Engineering and Computer Science at MIT as input, and found that our approach is competitive with conventional planners.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.
Includes bibliographical references (p. 83-84).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
