Advertisement

Information Hiding and the Complexity of Constraint Satisfaction

  • Remco C. Veltkamp
  • Richard H. M. C. Kelleners
Conference paper
Part of the Eurographics book series (EUROGRAPH)

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.

Keywords

Time Complexity Constraint Satisfaction Constraint Satisfaction Problem Constraint System Unary Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Sara Baase. Computer Algorithms: Introduction to Design and Analysis. Addison-Wesley, 1978.MATHGoogle Scholar
  2. [2]
    Grady Booch. Object-Oriented Analysis and Design — with applications. The Benjamin/Cummings Publishing, 1994.Google Scholar
  3. [3]
    C. Choppy, S. Kaplan, and M. Soria. Complexity analysis of term-rewriting systems. Theoretical Computer Science, 67(2/3):261–282, 1989.CrossRefMATHMathSciNetGoogle Scholar
  4. [4]
    Eric Cournarie and Michel Beaudouin-Lafon. Alien: a prototype-based constraint system. In Laffra et al. [11], pages 92–110.Google Scholar
  5. [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. [6]
    R. Dechter and J. Pearl. Network-based heuristics for constraint satisfaction problems. Al, 34:1–38, 1988.MathSciNetGoogle Scholar
  7. [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. [8]
    Eugene C. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24–32, January 1982.CrossRefMATHMathSciNetGoogle Scholar
  9. [9]
    Hans-Werner Güsgen and Joachim Hertzberg. Some fundamental properties of local constraint propagation. AI,36:237–247, 1988.MATHGoogle Scholar
  10. [10]
    Quinton Hoole and Edwin Blake. OOCS - constraints in an object oriented environment. In [24], pages 215–230, 1994.Google Scholar
  11. [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. [12]
    Chris Laffra and Jan van den Bos. Propagators and concurrent constraints. OOPS Messenger, 2(2):68–72, April 1991.CrossRefGoogle Scholar
  13. [13]
    Wm. Leler. Constraint Programming Languages. Addison-Wesley, 1988.Google Scholar
  14. [14]
    Richard J. Lipton. Dna solution of hard computational problems. Science, 268:542–545, April 1995.CrossRefGoogle Scholar
  15. [15]
    A. K. Mackworth. Consistency in networks of relations. AI,8:99–118, 1977.MATHGoogle Scholar
  16. [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. [17]
    R. Mohr and T. C. Henderson. Arc and path consistency revisited. AI, 28:225–233, 1986.Google Scholar
  18. [18]
    John R. Rankin. A graphics object oriented constraint solver. In Laffra et al. [11], pages 71–91.Google Scholar
  19. [19]
    Michael Sannella. Constraint Satisfaction and Debugging for Interactive User Interfaces. PhD thesis, University of Washington, Seattle, Washington, 1994.Google Scholar
  20. [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. [21]
    Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.Google Scholar
  22. [22]
    Remco C. Veltkamp and Edwin H. Blake. Event-based.constraints: coordinate.satisfaction -> object.solution. In [24], pages 251–262, 1994.Google Scholar
  23. [23]
    Michael Wilk. Equate: an object-oriented constraint solver. In Proceedings OOPSLA’91, pages 286–298, 1991.Google Scholar
  24. [24]
    P. Wisskirchen, editor. Proceedings 4th Eurographics Workshop on Object-Oriented Graphics, Sintra, Portugal, May 1994.Google Scholar

Copyright information

© Springer-Verlag/Wien 1995

Authors and Affiliations

  • Remco C. Veltkamp
    • 1
  • Richard H. M. C. Kelleners
    • 2
    • 3
  1. 1.Department of Computing ScienceUtrecht UniversityUtrechtThe Netherlands
  2. 2.Department of Interactive SystemsCWIAmsterdamThe Netherlands
  3. 3.Department of Computing ScienceTechnical University of EindhovenEindhovenThe Netherlands

Personalised recommendations