Dynamic constraint satisfaction in a bridge design system

  • Kefeng Hua
  • Boi Faltings
  • Djamila Haroud
  • Graham Kimberley
  • Ian Smith
Part of the Lecture Notes in Computer Science book series (LNCS, volume 462)


Constraint satisfaction with numerical constraints is a fundamental problem in automated design. Traditional constraint satisfaction procedures are designed for problems where there is one constant set of constraints. In design, it is often necessary to solve a dynamic constraint satisfaction problem (DCSP) where the set of applicable constraints depends on design choices. Finding a solution in DCSP requires searching among different consistent sets of constraints to find one which has an acceptable numerical solution. In this paper, an algorithm is described which supports the propagation of numerical intervals in such a dynamic environment.


Constraint Satisfaction Constraint Network Constraint Graph Default Reasoning Partial Order Relation 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Borning 1987]
    A. Borning, et al. “Constraint Hierarchies” Proceedings of OOPSLA 1987Google Scholar
  2. [Cooper 1989]
    Paul R. Cooper and Michael J. Swain “Domain Dependence in Parallel Constraint Satisfaction” IJCAI89 pp. 54Google Scholar
  3. [Davis 1987]
    Ernest Davis “Constraint Propagation With Interval Labels” Artificial Intelligence, 32, 1987.Google Scholar
  4. [Dechter 1988]
    R. Dechter, J. Pearl “A Tree-clustering Scheme for Constraint Processing” AAAI88 Google Scholar
  5. [Dechter 1988]
    Rina Dechter and Avi Dechter “Belief Maintenance in Dynamic Constraint Networks” AAAI88, pp37–42Google Scholar
  6. [Dechter 1989]
    Rina Dechter and Italy Meiri “Techniques in Constraint Satisfaction Problems” IJCAI89 pp. 271Google Scholar
  7. [Descotte 1985]
    Y. Descotte, J.C. Latombe 1985 “Making Compromises among Antagonist Constraints in a Planner” Artificial Intelligence 27(1985) pp.183–217.Google Scholar
  8. [Doyle 1979]
    Jon Doyle “A Truth Maintenance System” Artificial Intelligence 12, 1979. pp.127–162Google Scholar
  9. [Faltings 1989]
    “An Architecture for Design in Large Domains” The third IFIP WG 5.2 workshop on ICAD 1989 Google Scholar
  10. [Fox 1989]
    Marks S. Fox, Norman Sadeh and Can Baykan “Constrained Heuristic Search” IJCAI89 pp. 309Google Scholar
  11. [Freuder 1982]
    E.C. Freuder “A sufficient Condition of Backtrack-free Search” Journal of the ACM, Vol.29, No. 1, January 1982, pp.24–32Google Scholar
  12. [Freuder 1989]
    E. C. Freuder “Partial Constraint Satisfaction” IJCAI89 pp. 278Google Scholar
  13. [Havens 1989]
    W. S. Havens and Paul Stephen Rehfuss “Platypus: A Constraint-based Reasoning System” IJCAI89 pp. 48Google Scholar
  14. [Hua 1989]
    Kefeng Hua, Boi Faltings. I. Smith “Default Reasoning in a Bridge Design System” IFIP, The Third Workshop on ICAD, Osaka, Japan. 1989Google Scholar
  15. [Kanal 1988]
    L. Kanal, V. Kumar “Search in Artificial Intelligence” Sprinnger-Verlag 1988Google Scholar
  16. [Kleer 1986]
    Johan de Kleer “An Assumption-based TMS” Artificial Intelligence 28, 1986Google Scholar
  17. [Kleer 1989]
    Johan de Kleer “A Comparison of ATMS and CSP Techniques” IJCAI89 pp.290Google Scholar
  18. [Mackworth 1977]
    A.K. Mackworth “Consistency in networks of relations” Artificial Intelligence, 8 (1977) 99–118Google Scholar
  19. [Mittal 1987]
    S. Mittal, F. Frayman “Making Partial Choices in Constraint Reasoning Problems” AAAI87 pp.631–638Google Scholar
  20. [Mittal 1988]
    S. Mittal “Towards a Generic Model of Configuration Tasks” Xerox PARC. SSL Technical Report [P88-00197]Google Scholar
  21. [Montanari 1974]
    U. Montanari “Networks of Constraints: Fundamental Properties and Applications to Picture Processing” Information Science 7 (1974) 95–132Google Scholar
  22. [Reiter 1980]
    R. Reiter “A Logic for Default Reasoning” Artificial Intelligence 13, 1980. pp. 81–132.Google Scholar
  23. [Stallman 1977]
    R.M. Stallman, G.S. Sussman “Forward Reasoning and Dependency-directed Backtracking in a System for Computer-aided Circuit Analysis” Artificial Intelligence 9 (1977) 135–196.Google Scholar
  24. [Stefik 1981]
    M. Stefik “Planning with Constraints(Molgen:Part 1)” Artificial Intelligence 16 (1981)Google Scholar
  25. [Zweben89]
    Monte Zweben and Megan Eskey “Constraint Satisfaction With Delayed Evaluation” IJCAI89, pp. 875Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Kefeng Hua
    • 1
  • Boi Faltings
    • 1
  • Djamila Haroud
    • 1
  • Graham Kimberley
    • 2
  • Ian Smith
    • 2
  1. 1.Department of Computer ScienceLaboratory of Artificial IntelligenceSwitzerland
  2. 2.ICOM (Steel Structures), Department of Civil EngineeringSwiss Federal Institute of TechnologyLausanneSwitzerland

Personalised recommendations