Constructive disjunction revisited

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

Volumn 1137, Issue , 1996, Pages 377-386

  Würtz, Jörg ^a   Müller, Tobias ^b  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; SCHEDULING;

COMBINATORIAL PROBLEM; CONCURRENT CONSTRAINT; DISJUNCTIVE CONSTRAINTS; EXPERIMENTAL PLATFORM; FINITE DOMAINS; NEW APPROACHES; SEARCH SPACES; TIMETABLING;

PROBLEM SOLVING;

EID: 84888267463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61708-6_78     Document Type: Conference Paper

References (17)

1. A. Aggoun and N. Beldiceanu,’Extending CHIP in order to solve complex scheduling and placement problems’. Mathl. Comput. Modelling, volume 17, number 7, pp. 57-73, (1993).
2. P. Baptiste and C. Le Pape, ‘A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling’, in IJCAI, (1995).
3. B. Carlson and M. Carlsson, ‘Compiling and executing disjuctions of finite domain constraints’, in ICLP, pp. 117-131, (1995).
4. Y. Caseau and F. Laburthe, ‘Improved clp scheduling with task intervals’, in ICLP, (1994).
5. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier, ‘The constraint logic programming language CHIP’, in FGCS, pp. 693-702, (1988).
6. P. Van Hentenryck and Y. Deville, ‘The Cardinality Operator: A New Logical Connective for Constraint Logic Programming’, in ICLP, pp. 745-759, (1991).
7. M. Henz and J. Wiirtz, ‘Using Oz for college time tabling’, in International Conference on the Practice and Theory of Automated Time Tabling, pp. 283-296, (1995).
8. J. Jourdan and T. Sola, ‘The versatility of handling disjunctions as constraints’, in PLILP, pp. 60-74, (1993).
9. T. le Provost and M. Wallace, ‘Generalized constraint propagation over the CLP scheme’, Journal of Logic Programming, 16, 319-359, (1993).
10. T. Muller and J. Wiirtz, ‘Constructive Disjunction in Oz’, in 11. Workshop Logis- che Programmierung, (1995).
11. J.F. Muth and G.L. Thompson, Industrial Scheduling, Prentice Hall, 1963.
12. T. Le Provost and M. Wallace, ‘Generalized constraint propagation over the CLP scheme’, The Journal of Logic Programming, 16(3 & 4), 319-359, (1993).
13. C. Schulte and G. Smolka, ‘Encapsulated search in higher-order concurrent constraint programming’, in ILPS, pp. 505-520, (1994).
14. G. Smolka, ‘The definition of Kernel Oz’, DFKI Oz documentation series, Deutsches Forschungszentrum fur Kiinstliche Intelligenz GmbH, Stuhlsatzenhausweg 3, D-66123 Saarbriicken, Germany, (1994).
15. G. Smolka, ‘The Oz programming model’, in Computer Science Today, Lecture Notes in Computer Science, vol. 1000, 324-343, Springer-Verlag, (1995).
16. DFKI Oz Documentation Series, eds., G. Smolka and R. Treinen, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbriicken, Germany, 1995.
17. P. VailP. Van Hentenryck, V. Saraswat, and Y. Deville, ‘Design, implementation and evaluation of the constraint language cc(FD)’, in Constraints: Basics and Trends, Lecture Notes in Computer Science, vol. 910, Springer Verlag, (1995).