University course timetabling using constraint handling rules

Applied Artificial Intelligence

Volumn 14, Issue 4, 2000, Pages 311-325

  Abdennadher, Slim ^a   Marte, Michael ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; LOGIC PROGRAMMING;

CONSTRAINT PROPAGATION;

ARTIFICIAL INTELLIGENCE;

EID: 0034175279     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/088395100117016     Document Type: Article

References (25)

1. Abdennadher, S. 1997. Operational semantics and confluence of constraint propagation rules. In Third International Conference on Principles and Practice of Constraint Programming, LNCS 1330. New York: Springer.
2. Abdennadher, S., and M. Marte. 1998. University timetabling using constraint handling rules. In Actes des Journees Francophones de Programmation en Logique et Programmation par Contraintes.
3. e3.4 User Manual. Munich, Germany: European Computer Research Center (ECRC), July.
4. Azevedo, F., and P. Barahona. 1994. Timetabling in constraint logic programming. In Proceedings of 2nd World Congress on Expert Systems.
5. Bessiere, C., and J-C. Regin. 1996. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Second International Conference on Principles and Practice of Constraint Programming, LNCS 1118, 61-75. New York: Springer.
6. Bistarelli, S., U. Montanari, and F. Rossi. 1997. Semiring-based constraint satisfaction and optimization. Journal of the ACM 44(2):201-236.
7. Borning, A., B. N. Freeman-Benson, and M. Wilson. 1992. Constraint hierarchies. Lisp and Symbolic Computation 5(3):223-270.
8. Frangouli, H., V. Harmandas, and P. Stamatopoulos. UTSE: Construction of optimum timetables for university courses-A CLP based approach. In Proceedings of the Third International Conference on the Practical Applications of Prolog, 225-243.
9. Freuder, E. C., and R. J. Wallace. 1992. Partial constraint satisfaction. Artificial Intelligence 58(1-3): 21-70.
10. Fruhwirth, T. 1995. Constraint handling rules. In Constraint Programming: Basics and Trends, ed. A Padelski. LNCS 910. New York: Springer.
11. Fruhwirth, T. 1998. Theory and practice of constraint handling rules (Special issue on constraint logic programming). Journal of Logic Programming, 37(1-3):95-138.
12. Fruhwirth, T., and S. Abdennadher. 1997. Constraint-Programmierung: Grundlagen und Anwendungen. New York: Springer.
13. Haralick, R. M., and G. L. Elliott. 1980. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14:263-313.
14. Henz, M., and J. Wurtz. 1995. Using Oz for college time tabling. In Proceedings of the First International Conference on the Practice and Theory of Automated Timetabling, 283-296.
15. Jaffar, J., and M. J. Maher. 1994. Constraint logic programming: A survey. The Journal of Logic Programming 19-20:503-582.
16. Kumar, V. 1992. Algorithms for constraint-satisfaction problems: A survey. AI Magazine 13(1):32-44.
17. Mackworth, A K. 1992. Constraint satisfaction. In Encyclopedia of Artificial Intelligence, 2nd ed., Vol. 1, ed. Stuart C. Shapiro, 285-293. New York: Wiley.
18. Marriott, K., and P. Stuckey. 1998. Programming with Constraints: An Introduction. Cambridge: MIT Press.
19. Marte, M. 1998. Constraint-based grammar school timetabling-A case study. Diplomarbeit, Lehr-und Forschungseinheit fur Programmier-und Modellierungssprachen, Institut für Informatik, Ludwig-Maximilians-Universitat Munchen.
20. Meyer auf’m Hofe, H. 1997. ConPlan/SIEDAplan: Personnel assignment as a problem of hierarchical constraint satisfaction. In Proceedings of the 3rd International Conference on the Practical Application of Constraint Technology, 257-272, 1997.
21. Mohr, R., and G. Masini. 1988. Good old discrete relaxation. In Proceedings of the 8th European Conference on Artificial Intelligence, 651-656. Boston: Pitman Publishers.
22. Sabin, D., and E. C. Freuder. 1997. Understanding and improving the mac algorithm. In Third International Conference on Principles and Practice of Constraint Programming, LNCS 1330, 167-181. New York: Springer.
23. Schaerf, A. 1995. A survey of automated timetabling. Technical Report CS-R9567, CWI-Centrum voor Wiskunde en Informatica.
24. van Hentenryck, P. 1989. Constraint Satisfaction in Logic Programming. Cambridge: MIT Press.
25. Wallace, M. 1996. Practical applications of constraint programming. Constraints Journal 1:139-168.