Abstract
Design tasks in structural engineering have always involved the use of constraints to formulate design requirements. Most existing algorithms for constraint satisfaction require input consisting of binary constraints on variables that have discrete values. Such restrictions limit their use in structural engineering since typical structural design tasks involve discrete and numerical variables. This paper provides an approach for decision support through approximating solution spaces of such constraint problems by local consistency. The approach is demonstrated for the selection of appropriate wind bracing for single story steel-framed buildings involving more than hundred variables. Finally, extension to conditional constraint satisfaction using different combinations of activation conditions is straightforward.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benhamou, F.: 1996, Heterogeneous constraint solving, in M. Hanus, and M. Rodriguez-Artalejo, (eds.), Algebraic and Logic Programming, 5th International Conference, ALP’96, Lecture Notes in Computer Science Springer-Verlag 1139, Aachen, pp. 62–76.
Benhamou, F. and McAllester, D. and Hentenryck, P.V: 1994, CLP (intervals) revisited, in M. Bruynooghe, (ed.), Logic Programming-Proceedings of the 1994 International Symposium, The MIT Press, pp. 124–138.
Bessière, C. and Régin, J.-C: 1996, Mac and combined heuristics: Two reasons to forsake fc (and cbj) on hard problems, in E. Freuder, and M. Jampel (eds.), Principles and Practice of Constraint Programming, Lecture Notes in Computer Science 1118. Springer-Verlag, 61–75.
Davis E: 1987, Constraint propagation with interval labels, Artificial Intelligence, 32.
Dechter, R.: 1990, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, 41(3), 273–312.
Faltings, B.: 1994, Arc consistency for continuous variables, Artificial Intelligence, 65(2), 85–118.
Faltings, B. and Gelle, E.: 1997, Local consistency for ternary numeric constraints. Proceedings of the 11th International Joint Conference on Artificial Intelligence IJCAI-97, pp. 392–397.
Freuder, E. C.: 1982, A sufficient condition for backtrack-bounded search, Journal of the ACM, 32(4), 755–761.
Freuder, E. C.: 1982, A sufficient condition for backtrack-free search, Journal of the ACM, 29(1), 24–32.
Gelle, E.: 1998, On the generation of locally consistent solution spaces in mixed dynamic constraint problems, PhD thesis No. 1826, Swiss Federal Institute of Technology (EPFL).
Haralick, R. M. and Elliott, G. L.: 1980, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, 14, 263–313.
Hyvönen, E.: 1992, Constraint reasoning based on interval arithmetic. The tolerance propagation approach, Artificial Intelligence, 58, 71–112
Kondrak, G.: 1994, A theoretical evaluation of selected backtracking algorithms, Technical Report TR-94-10, University of Alberta.
Lhomme, O.: 1993, Consistency techniques for numeric CSPs, Proceedings of the 9th International Joint Conference on Artificial Intelligence IJCAI-93, pp. 232–238.
Lottaz, C., Clément D., Faltings, B. and Smith, I.: 1999, Constraint-based support for collaboration in design and construction, Journal of Computing in Civil Engineering, 13(1), 23–35.
Mackworth, A.: 1977, Consistency in networks of relations, Artificial Intelligence, 8, 69–78.
McGregor, J.J.: 1979, Relational consistency algorithms and their application in finding subgraph and graph isomorphisms, Information Sciences, 19, 229–250.
Mittal, S. and Falkenhainer, B.: 1990, Dynamic constraint satisfaction problems, in T. Dietterich, and W. Swartout, (eds.), Proceedings of the 8th National Conference on Artificial Intelligence, The MIT Press, pp. 25–32.
Montanari, U.: 1974, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, 7, 95–132.
Moore, R. E. (ed.): 1979, Methods and Applications of Interval Analysis, Society for Industrial and Applied Mathematics, Philadelphia, USA.
Sabin, D. and Freuder, E.: 1994, Contradicting conventional wisdom in constraint satisfaction, in A. Borning, (ed.), Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, 874, Springer-Verlag.
Sam-Haroud, D. and Faltings, B.: 1996, Consistency techniques for continuous constraints, Constraints, 1, 85–118.
Tinelli, C. and Harandi, M.: 1996, Constraint logic programming over unions of constraint theories, Lecture Notes in Computer Science, 1118, 436–450.
Van Beek, P. and Dechter, R.: 1995, On the minimality and global consistency of row-convex constraint networks, Journal of the ACM, 42(3), 543–561.
Van Hentenryck, P., McAllester, D. and Kapur, D.: 1995, Solving polynomial systems using a branch and prune approach, SIAM Journal, 34(2).
Van Hentenryck, P., Micher, L. and Deville, Y. (eds.): 1997, Numerica. A modeling language for global optimization. The MIT Press.
Waltz, D. L.: 1975, Understanding line drawings of scenes with shadows, in P. H. Winston (ed.), The Psychology of Computer Vision, McGraw-Hill, pp. 19–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Gelle, E.M., Faltings, B.V., Smith, I.F.C. (2000). Structural Engineering Design Support by Constraint Satisfaction. In: Gero, J.S. (eds) Artificial Intelligence in Design ’00. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4154-3_16
Download citation
DOI: https://doi.org/10.1007/978-94-011-4154-3_16
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5811-7
Online ISBN: 978-94-011-4154-3
eBook Packages: Springer Book Archive