Artificial intelligence
Optimizing decision trees through heuristically guided search
Communications of the ACM
Logic for Problem Solving
TIMELOG-an intelligent spreadsheet for school timetabling
ACM SIGART Bulletin
A Survey of Automated Timetabling
Artificial Intelligence Review
| Hi-index | 0.00 |
The school Time-Table Scheduling task is a very hard operations research and engineering problem, especially when-implemented in a conventional language. That is due to the imperative, deterministic nature of most conventional languages, such as BASIC and PASCAL and to the long series of constraints and goals inside the problem. The descriptive, logic-based and nondeterministic nature of Prolog language, and its ability to backtrack allows one to easily obtain a deductive data base, mixing the facts, rules, and constraints of the Time-table. Two systems, one nonmonotonic, and one monotonic with a non-monotonic reasoning structure are compared and their performances in a significant test are discussed. The approach may be easily generalized to other analogous engineering, scheduling and operations research problems.