Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Transforming ordered constraint hierarchies into ordinary constraint systems

  • Constraint Logic Programming
  • Conference paper
  • First Online:
Over-Constrained Systems (OCS 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1106))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alan Borning and Robert Duisberg. Constraint-based tools for building user interfaces. ACM Transactions on Graphics, 5(4):345–374, October 1986.

    Google Scholar 

  2. Alan Borning, Robert Duisberg, Bjorn Freeman-Benson, Axel Kramer, and Michael Woolf. Constraint hierarchies. In Proceedings of the OOPSLA, 1987.

    Google Scholar 

  3. ECRC, München. ECL i PS e 3.5, Extensions User Manual, 1995.

    Google Scholar 

  4. ECRC, München. ECL i PS e 3.5, User Manual, 1995.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. G. Nelson. Juno, a constraint-based graphics system. Computer Graphics, ACM SIGGRAPH, pages 235–243, 1985.

    Google Scholar 

  9. Francis Newberry Paulisch and Walter F. Tichy. Edge: An extendible graph editor. Software — Practice and Experience, 20(S1):63–88, June 1990.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. Ken Satoh and Akira Aiba. Computing soft constraints by hierarchical constraint logic programming. Technical Report 610, Institute for New Generation Computer Technology (ICOT), 1991.

    Google Scholar 

  12. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1986.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. Molly Ann Wilson. Hierarchical Constraint Logic Programming. PhD thesis, Dept. of Computer Science and Engineering, University of Washington, 1993.

    Google Scholar 

  15. Molly Ann Wilson and Alan Borning. Hierachical constraint logic programming. The Journal of Logic Programming, 16(3 & 4):277–318, July and August 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GMD - German National Research Center for Information Technology, GMD FIRST, Rudower Chaussee 5, D-12489, Berlin, Germany

    Armin Wolf

Authors
  1. Armin Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Jampel Eugene Freuder Michael Maher

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation