Information Hiding and the Complexity of Constraint Satisfaction | SpringerLink
Skip to main content

Information Hiding and the Complexity of Constraint Satisfaction

  • Conference paper
Programming Paradigms in Graphics

Part of the book series: Eurographics ((EUROGRAPH))

  • 43 Accesses

Abstract

This paper discusses the complexity of constraint satisfaction, and the effect of information hiding. On the one hand, powerful constraint satisfaction is necessarily global, and tends to break information hiding. On the other hand, preserving strict information hiding increases the complexity of constraint satisfaction, or severely limits the power of the constraint solver. Ultimately, under strict information hiding, constraint satisfaction on complex objects cannot be guaranteed.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Sara Baase. Computer Algorithms: Introduction to Design and Analysis. Addison-Wesley, 1978.

    MATH  Google Scholar 

  2. Grady Booch. Object-Oriented Analysis and Design — with applications. The Benjamin/Cummings Publishing, 1994.

    Google Scholar 

  3. C. Choppy, S. Kaplan, and M. Soria. Complexity analysis of term-rewriting systems. Theoretical Computer Science, 67(2/3):261–282, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  4. Eric Cournarie and Michel Beaudouin-Lafon. Alien: a prototype-based constraint system. In Laffra et al. [11], pages 92–110.

    Google Scholar 

  5. Jacques Davy. Go, a graphical and interactive C++ toolkit for application data presentation and editing. In Proceedings 5th Annual Technical Conference on the X Window System, 1991.

    Google Scholar 

  6. R. Dechter and J. Pearl. Network-based heuristics for constraint satisfaction problems. Al, 34:1–38, 1988.

    MathSciNet  Google Scholar 

  7. Bjorn N. Freeman-Benson and Alan Borning. Integrating constraints with an object-oriented language. In O. Lehrmann Madsen, editor, Proceedings ECOOP’92,LNCS 615, pages 268–286. Springer-Verlag, 1992.

    Google Scholar 

  8. Eugene C. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24–32, January 1982.

    Article  MATH  MathSciNet  Google Scholar 

  9. Hans-Werner Güsgen and Joachim Hertzberg. Some fundamental properties of local constraint propagation. AI,36:237–247, 1988.

    MATH  Google Scholar 

  10. Quinton Hoole and Edwin Blake. OOCS - constraints in an object oriented environment. In [24], pages 215–230, 1994.

    Google Scholar 

  11. C. Laffra, E. H. Blake, V. de Mey, and X. Pintado, editors. Object Oriented Programming for Graphics, Focus on Computer Graphics. Springer, 1995.

    Google Scholar 

  12. Chris Laffra and Jan van den Bos. Propagators and concurrent constraints. OOPS Messenger, 2(2):68–72, April 1991.

    Article  Google Scholar 

  13. Wm. Leler. Constraint Programming Languages. Addison-Wesley, 1988.

    Google Scholar 

  14. Richard J. Lipton. Dna solution of hard computational problems. Science, 268:542–545, April 1995.

    Article  Google Scholar 

  15. A. K. Mackworth. Consistency in networks of relations. AI,8:99–118, 1977.

    MATH  Google Scholar 

  16. A. K. Mackworth and E. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. AI, 25:65–74, 1985.

    Google Scholar 

  17. R. Mohr and T. C. Henderson. Arc and path consistency revisited. AI, 28:225–233, 1986.

    Google Scholar 

  18. John R. Rankin. A graphics object oriented constraint solver. In Laffra et al. [11], pages 71–91.

    Google Scholar 

  19. Michael Sannella. Constraint Satisfaction and Debugging for Interactive User Interfaces. PhD thesis, University of Washington, Seattle, Washington, 1994.

    Google Scholar 

  20. Ivan E. Sutherland. Sketchpad: A man-machine graphical communication system. In Proceedings of the Spring Joint Computer Conference, Detroit, Michigan, May 21–231963, pages 329–345. AFIPS Press, 1963.

    Google Scholar 

  21. Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.

    Google Scholar 

  22. Remco C. Veltkamp and Edwin H. Blake. Event-based.constraints: coordinate.satisfaction -> object.solution. In [24], pages 251–262, 1994.

    Google Scholar 

  23. Michael Wilk. Equate: an object-oriented constraint solver. In Proceedings OOPSLA’91, pages 286–298, 1991.

    Google Scholar 

  24. P. Wisskirchen, editor. Proceedings 4th Eurographics Workshop on Object-Oriented Graphics, Sintra, Portugal, May 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag/Wien

About this paper

Cite this paper

Veltkamp, R.C., Kelleners, R.H.M.C. (1995). Information Hiding and the Complexity of Constraint Satisfaction. In: Veltkamp, R.C., Blake, E.H. (eds) Programming Paradigms in Graphics. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-9457-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-9457-7_5

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82788-8

  • Online ISBN: 978-3-7091-9457-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics