2026-09-20T11:34:07Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/370922022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Daniel Jackson.
Yeung, Vincent S. (Vincent Shu Hang)
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2007-04-03T17:10:44Z
2007-04-03T17:10:44Z
2006
2006
http://hdl.handle.net/1721.1/37092
84842561
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.
Includes bibliographical references (p. 83-84).
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.
by Vincent S. Yeung.
M.Eng.
84 p.
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Declarative configuration applied to course scheduling
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="102f118d-863b-41ca-8edd-b387cf85d0a5">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Declarative configuration applied to course scheduling</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2006</PublicationDate>
<Authors>
<Author>
<DisplayName>Yeung, Vincent S. (Vincent Shu Hang)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>