Abstract
Finite Domain Programming is a technique for solving combinatorial problems like planning, scheduling, configuration or timetabling. Inevitably, these problems employ disjunctive constraints. A rather new approach to model those constraints is constructive disjunction, whereby common information is lifted from the alternatives, aiming for stronger pruning of the search space. We show where constructive disjunction provides for stronger pruning and where it fails to do so. For several problems, including a real-world college timetabling application, benefits ↭d limitations of constructive disjunction are exemplified. As an experimental platform we use the concurrent constraint language Oz.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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).
P. Baptiste and C. Le Pape, ‘A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling', in IJCAI, (1995).
B. Carlson and M. Carlsson, ‘Compiling and executing disjuctions of finite domain constraints', in ICLP, pp. 117–131, (1995).
Y. Caseau and F. Laburthe, ‘Improved clp scheduling with task intervals', in ICLP, (1994).
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).
P. Van Hentenryck and Y. Deville, ‘The Cardinality Operator: A New Logical Connective for Constraint Logic Programming', in ICLP, pp. 745–759, (1991).
M. Henz and J. Würtz, ‘Using Oz for college time tabling', in International Conference on the Practice and Theory of Automated Time Tabling, pp. 283–296, (1995).
J. Jourdan and T. Sola, ‘The versatility of handling disjunctions as constraints', in PLILP, pp. 60–74, (1993).
T. le Provost and M. Wallace, ‘Generalized constraint propagation over the CLP scheme', Journal of Logic Programming, 16, 319–359, (1993).
T. Müller and J. Würtz, ‘Constructive Disjunction in Oz', in 11. Workshop Logische Programmierung, (1995).
J.F. Muth and G.L. Thompson, Industrial Scheduling, Prentice Hall, 1963.
T. Le Provost and M. Wallace, ‘Generalized constraint propagation over the CLP scheme', The Journal of Logic Programming, 16(3 & 4), 319–359, (1993).
C. Schulte and G. Smolka, ‘Encapsulated search in higher-order concurrent constraint programming', in ILPS, pp. 505–520, (1994).
G. Smolka, ‘The definition of Kernel Oz', DFKI Oz documentation series, Deutsches Forschungszentrum für Künstliche Intelligenz GmbH, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, (1994).
G. Smolka, ‘The Oz programming model', in Computer Science Today, Lecture Notes in Computer Science, vol. 1000, 324–343, Springer-Verlag, (1995).
DFKI Oz Documentation Series, eds., G. Smolka and R. Treinen, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, 1995.
P. 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).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Würtz, J., Müller, T. (1996). Constructive disjunction revisited. In: Görz, G., Hölldobler, S. (eds) KI-96: Advances in Artificial Intelligence. KI 1996. Lecture Notes in Computer Science, vol 1137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61708-6_78
Download citation
DOI: https://doi.org/10.1007/3-540-61708-6_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61708-2
Online ISBN: 978-3-540-70669-4
eBook Packages: Springer Book Archive