Modelling an academic curriculum plan as a mixed-initiative constraint satisfaction problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3501 LNAI, Issue , 2005, Pages 79-90

  Wu, Kun ^a   Havens, William S ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION; CONSTRAINT THEORY; PLANNING; PROBLEM SOLVING; SCHEDULING; VISUALIZATION;

CONSTRAINT REASONING ALGORITHMS; CURRICULUM SCHEDULING; DYNAMIC BACKTRACKING;

CURRICULA;

EID: 26944498269     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11424918_10     Document Type: Conference Paper

References (14)

1. A. Schaerf. A survey of automated timetabling. Artificial Intelligence Review, Vol. 13(2) (1999) pp. 87-127.
2. C. Castro and S. Manzano. Variable and Value Ordering: When Solving Balanced Academic Curriculum Problems. In Proceedings of 6th Workshop of the ERCIM WG on Constraints, Prague. June, 2001.
3. M. Walker, and S. Whittaker. Mixed-initiative in dialogue: an investiation into discourse segmentation. In Proceedings of ACL90, (Pittsburgh, PA, 1990) pp. 70-76.
4. C. Guinn. Mechanisms for mixed-initiative human-computer collaborative discourse. In Proceedings of ACL96, (Santa Cruz, CA, 1996) pp. 27-205.
5. J. Allen. Mixed-initiative planning: position paper. Presented at ARPA/Rome Labs Planning Initiative Workshop, 1994.
6. B. Miller. Is explicit representation of initiative desirable? Working Notes of AAAI97 Spring Symposium on Mixed Initiative Interaction. Stanford, CA, 1997.
7. P.Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, Vol. 9(3) (1993) pp. 268-299.
8. M. L. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, Vol. 1 (1993) pp. 25-46.
9. P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings of fourth Conference on Principles and practice of Constraint Programming, (Pisa, 1998) pp. 417-431.
10. W. S. Havens, Bistra N. Dilkina. A Hybrid Schema for Systematic Local Search. In Proceedings of Canadian Conference on AI 2004, (London, ON, Canada, 2004) pp. 248-260.
11. N. Jussien, and O. Lhomme. Local search with constraint propagation and conflict-based heuristics. Journal of Artificial Intelligence, Vol. 139 (2002) pp. 21-45.
12. P. Flener, A. Frisch et. al. Breaking row and column symmetries in matrix models. In Proceedings of CP'2002, (Springer, 2002) pp. 94-107.
13. A. Frisch, B. Hnich et. al. Global Constraints for Lexicographic Orderings. Constraint Programming 2002. pp.93-108, 2002.
14. Actenum Corporation, Constraint Works, Vancouver, British Columbia, Canada, www.actenum.com.