Local search with constraint propagation and conflict-based heuristics
Artificial Intelligence
A Survey of Automated Timetabling
Artificial Intelligence Review
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Global Constraints for Lexicographic Orderings
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Breaking Row and Column Symmetries in Matrix Models
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Mixed initiative in dialogue: an investigation into discourse segmentation
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Mechanisms for mixed-initiative human-computer collaborative discourse
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Journal of Artificial Intelligence Research
Scheduling meetings in distance learning
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Hi-index | 0.00 |
This paper describes a mixed-initiative constraint satisfaction system for planning the academic schedules of university students Our model is distinguished from traditional planning systems by applying mixed-initiative constraint reasoning algorithms which provide flexibility in satisfying individual student preferences and needs The graphical interface emphasizes visualization and direct manipulation capabilities to provide an efficient interactive environment for easy communication between the system and the end user The planning process is split into two phases The first phase builds an initial plan using a systematic search method based on a variant of dynamic backtracking The second phase involves a semi-systematic local search algorithm which supports mixed-initiative user interaction and control of the search process Generated curriculum schedules satisfy both academic program constraints and user constraints and preferences Part of the challenge in curriculum scheduling is handling multiple possible schedules which are equivalent under symmetry We show to overcome these symmetries in the search process Experiments with actual course planning data show that our mixed-initiative systems generates effective curriculum plans efficiently.