%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:35 +0100 GMT
%    
% Selection : Reference #622
%




@Article{Henz_Würtz:1996,
      AUTHOR = {Henz, Martin and Würtz, Jörg},
      TITLE = {Constraint-Based Time Tabling - A Case Study},
      YEAR = {1996},
      JOURNAL = {Applied Artificial Intelligence},
      VOLUME = {10},
      NUMBER = {5},
      PAGES = {439-453},
      ABSTRACT = {In this paper, we concentrate on a typical scheduling problem: the computation of a time table for a German college. Like many other scheduling problems, this problem contains a variety of complex constraints and necessitates special-purpose search strategies. Techniques from Operations Research and traditional constraint logic programming are not able to express these constraints and search strategies on a sufficiently high level of abstraction. We show that the higher-order concurrent constraint language Oz provides this high-level expressivity, and can serve as a useful programming tool for college time tabling.}
}