Abstract
In this paper, we propose ordered constraint hierarchies and a non-trivial error function to model and solve over-constrained real-world problems adequately. We substantiate our proposition by an example. Then we present a new method to transform constraint hierarchies into equivalent ordinary constraint systems. For practical applications, we present a modified algorithm based on an incomplete finite domain constraint solver. We conclude with a prototype implementation of the method and some aspects about our future work.
The research in this paper is a result of the project WISPRO funded by the German Federal Minister for Education, Science, Research, and Technology (BMBF) under grant no. 01 IW 206.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alan Borning and Robert Duisberg. Constraint-based tools for building user interfaces. ACM Transactions on Graphics, 5(4):345–374, October 1986.
Alan Borning, Robert Duisberg, Bjorn Freeman-Benson, Axel Kramer, and Michael Woolf. Constraint hierarchies. In Proceedings of the OOPSLA, 1987.
ECRC, München. ECL i PS e 3.5, Extensions User Manual, 1995.
ECRC, München. ECL i PS e 3.5, User Manual, 1995.
Bjorn Freeman-Benson, Molly Wilson, and Alan Borning. DeltaStar: A general algorithm for incremental satisfaction of constraint hierarchies. In Proceedings of the 11th Annual IEEE Phoenix Conference on Computers and Communication, pages 561–568. IEEE, March 1992.
H.-J. Goltz. Reducing domains for search in CLP(FD) and its application to job-shop scheduling. In Ugo Montanari and Francesca Rossi, editors, Proceedings of the First International Conference on Principles and Practice of Constraint Programming 1995, number 976 in Lecture Notes in Computer Science, pages 549–562. Springer Verlag, 1995.
Nevin C. Heintze, Spiro Michaylov, Peter J. Stuckey, and Roland H.C. Yap. The CLP(R) Programmer's Manual, Version 1.2. IBM Thomas J. Watson Research Center, PO Box 704, Yorktown Heights, NY 10598, U.S.A., September 1992.
G. Nelson. Juno, a constraint-based graphics system. Computer Graphics, ACM SIGGRAPH, pages 235–243, 1985.
Francis Newberry Paulisch and Walter F. Tichy. Edge: An extendible graph editor. Software — Practice and Experience, 20(S1):63–88, June 1990.
Michael Sannella. The SkyBlue constraint solver and its applications. In Vijay A. Saraswat and Pascal van Hentenryck, editors, Proceedings of the 1993 Workshop on Principles and Practice of Constraint Programming. The MIT Press, 1994.
Ken Satoh and Akira Aiba. Computing soft constraints by hierarchical constraint logic programming. Technical Report 610, Institute for New Generation Computer Technology (ICOT), 1991.
A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1986.
Fujio Tsusumi. An efficient algorithm of logic programming with constraint hierarchy. In Jean-Pierre Jouannaud, editor, Proceedings of the First International Conference on Constraints in Computational Logics, number 845 in Lecture Notes in Computer Science, pages 170–182. Springer Verlag, 1994.
Molly Ann Wilson. Hierarchical Constraint Logic Programming. PhD thesis, Dept. of Computer Science and Engineering, University of Washington, 1993.
Molly Ann Wilson and Alan Borning. Hierachical constraint logic programming. The Journal of Logic Programming, 16(3 & 4):277–318, July and August 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wolf, A. (1996). Transforming ordered constraint hierarchies into ordinary constraint systems. In: Jampel, M., Freuder, E., Maher, M. (eds) Over-Constrained Systems. OCS 1995. Lecture Notes in Computer Science, vol 1106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61479-6_21
Download citation
DOI: https://doi.org/10.1007/3-540-61479-6_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61479-1
Online ISBN: 978-3-540-68601-9
eBook Packages: Springer Book Archive