Declarative configuration applied to course scheduling
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/37092 |
| _version_ | 1826189914738262016 |
|---|---|
| author | Yeung, Vincent S. (Vincent Shu Hang) |
| author2 | Daniel Jackson. |
| author_facet | Daniel Jackson. Yeung, Vincent S. (Vincent Shu Hang) |
| author_sort | Yeung, Vincent S. (Vincent Shu Hang) |
| collection | MIT |
| description | Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006. |
| first_indexed | 2024-09-23T08:29:31Z |
| format | Thesis |
| id | mit-1721.1/37092 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T08:29:31Z |
| publishDate | 2007 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/370922019-04-09T18:19:36Z Declarative configuration applied to course scheduling Yeung, Vincent S. (Vincent Shu Hang) Daniel Jackson. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. 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. 2007-04-03T17:10:44Z 2007-04-03T17:10:44Z 2006 2006 Thesis http://hdl.handle.net/1721.1/37092 84842561 eng 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 84 p. application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Yeung, Vincent S. (Vincent Shu Hang) Declarative configuration applied to course scheduling |
| title | Declarative configuration applied to course scheduling |
| title_full | Declarative configuration applied to course scheduling |
| title_fullStr | Declarative configuration applied to course scheduling |
| title_full_unstemmed | Declarative configuration applied to course scheduling |
| title_short | Declarative configuration applied to course scheduling |
| title_sort | declarative configuration applied to course scheduling |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/37092 |
| work_keys_str_mv | AT yeungvincentsvincentshuhang declarativeconfigurationappliedtocoursescheduling |