Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Borning, et al. “Constraint Hierarchies” Proceedings of OOPSLA 1987
Paul R. Cooper and Michael J. Swain “Domain Dependence in Parallel Constraint Satisfaction” IJCAI89 pp. 54
Ernest Davis “Constraint Propagation With Interval Labels” Artificial Intelligence, 32, 1987.
R. Dechter, J. Pearl “A Tree-clustering Scheme for Constraint Processing” AAAI88
Rina Dechter and Avi Dechter “Belief Maintenance in Dynamic Constraint Networks” AAAI88, pp37–42
Rina Dechter and Italy Meiri “Techniques in Constraint Satisfaction Problems” IJCAI89 pp. 271
Y. Descotte, J.C. Latombe 1985 “Making Compromises among Antagonist Constraints in a Planner” Artificial Intelligence 27(1985) pp.183–217.
Jon Doyle “A Truth Maintenance System” Artificial Intelligence 12, 1979. pp.127–162
“An Architecture for Design in Large Domains” The third IFIP WG 5.2 workshop on ICAD 1989
Marks S. Fox, Norman Sadeh and Can Baykan “Constrained Heuristic Search” IJCAI89 pp. 309
E.C. Freuder “A sufficient Condition of Backtrack-free Search” Journal of the ACM, Vol.29, No. 1, January 1982, pp.24–32
E. C. Freuder “Partial Constraint Satisfaction” IJCAI89 pp. 278
W. S. Havens and Paul Stephen Rehfuss “Platypus: A Constraint-based Reasoning System” IJCAI89 pp. 48
Kefeng Hua, Boi Faltings. I. Smith “Default Reasoning in a Bridge Design System” IFIP, The Third Workshop on ICAD, Osaka, Japan. 1989
L. Kanal, V. Kumar “Search in Artificial Intelligence” Sprinnger-Verlag 1988
Johan de Kleer “An Assumption-based TMS” Artificial Intelligence 28, 1986
Johan de Kleer “A Comparison of ATMS and CSP Techniques” IJCAI89 pp.290
A.K. Mackworth “Consistency in networks of relations” Artificial Intelligence, 8 (1977) 99–118
S. Mittal, F. Frayman “Making Partial Choices in Constraint Reasoning Problems” AAAI87 pp.631–638
S. Mittal “Towards a Generic Model of Configuration Tasks” Xerox PARC. SSL Technical Report [P88-00197]
U. Montanari “Networks of Constraints: Fundamental Properties and Applications to Picture Processing” Information Science 7 (1974) 95–132
R. Reiter “A Logic for Default Reasoning” Artificial Intelligence 13, 1980. pp. 81–132.
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.
M. Stefik “Planning with Constraints(Molgen:Part 1)” Artificial Intelligence 16 (1981)
Monte Zweben and Megan Eskey “Constraint Satisfaction With Delayed Evaluation” IJCAI89, pp. 875
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hua, K., Faltings, B., Haroud, D., Kimberley, G., Smith, I. (1990). Dynamic constraint satisfaction in a bridge design system. In: Gottlob, G., Nejdl, W. (eds) Expert Systems in Engineering Principles and Applications. ESE 1990. Lecture Notes in Computer Science, vol 462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53104-1_44
Download citation
DOI: https://doi.org/10.1007/3-540-53104-1_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53104-3
Online ISBN: 978-3-540-46711-3
eBook Packages: Springer Book Archive