Constraint satisfaction methods for applications in engineering

Engineering with Computers

Volumn 16, Issue 2, 2000, Pages 81-95

  Gelle, E ^a   Faltings, B V ^a   Clement D E ^b   Smith, I F C ^b  

^a Artif Intelligence Laboratory (LIA)   (Switzerland)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECISION SUPPORT SYSTEMS; KNOWLEDGE REPRESENTATION;

CONSTRAINT SATISFACTION PROBLEMS (CSP);

CONSTRAINT THEORY;

EID: 0034467697     PISSN: 01770667     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00007190     Document Type: Article

References (31)

1. Lottaz, C., Clément, D., Faltings, B., Smith, I. (1999) Constraint-based support for collaboration in design and construction. J. Computing in Civil Engineering, 13(1), 23-35.
2. Waltz, D.L. (1975) Understanding line drawings of scenes with shadows. In: Winston, P.H. (Editor), The Psychology of Computer Vision. McGraw-Hill, 19-91.
3. Mackworth, A. (1977) Consistency in networks of relations. Artificial Intelligence, 8.
4. Montanari, U. (1974) Networks of constraints: Fundamental properties and applications to picture processing. Information Science, 7, 95-132.
5. Tsang, E. (1993) Foundations of Constraint Satisfaction. London, Academic Press.
6. Kumar, V. (1992) Algorithms for constraint-satisfaction problems: A survey. AI Magazine, 13(1), 32-44.
7. Freuder, E.C. (1982) A sufficient condition for backtrack-free search. J. ACM, 29(1), 24-32.
8. Freuder, E.C., (1982) A sufficient condition for backtrack-bounded search. J. ACM, 32(4), 755-761.
9. Van Hentenryck, P., Deville, Y., Teng, C.-M. (1992) A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57(2-3), 291-321.
10. Dechter, R. (1990) Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence, 41(3); 273-312.
11. van Beek, P., Dechter, R, (1995) On the minimality and global consistency of row-convex constraint networks. J. ACM, 42(3), 543-561.
12. Haralick, R.M., Elliott, G.L. (1980) Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence, 14, 263-313.
13. McGregor, J.J. (1979) Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Information Sciences, 19, 229-250.
14. Prosser, P. (1993) Domain filtering can degrade intelligent backjumping search. IJCAI-93.
15. Van Hentenryck, P., McAllester, D., Kapur, D. (1995) Solving polynomial systems using a branch and prune approach. SIAM J. Numerical Analysis (accepted). (Also available as Brown University technical report CS-95-01.)
16. Lhomme, O. (1993) Consistency techniques for numeric CSPs. IJCAI-93, 232-238.
17. Hyvönen, E. (1992) Constraint reasoning based on interval arithmetic. The tolerance propagation approach. Artificial Intelligence.
18. Davis, E. (1987) Constraint propagation with interval labels. Artificial Intelligence, 32.
19. Sam-Haroud, D., Faltings, B. (1996) Consistency techniques tor continuous constraints. Constraints, 1, 85-118.
20. Mittal, S., Falkenhainer, B. (1990) Dynamic constraint satisfaction problems. In: Dietterich, T., Swartout, W. (Editors) Proceedings of the 8th National Conference on Artificial Intelligence, MIT Press, 25-32.
21. Faltings, B. (1994) Arc consistency for continuous variables. Artificial Intelligence, 65(2), 85-118.
22. Gelle, E. (1998) On the generation of locally consistent solution spaces in mixed dynamic constraint problems. PhD thesis, Swiss Federal Institute of Technology, EPFL.
23. Tinelli, C., Harandi, M. (1996) Constraint logic programming over unions of constraint theories. Lecture Notes in Computer Science 1118. Springer-verlag, 436-450.
24. Benhamou, P., McAllester, D., Hentenryck, P.V. (1994) CLP (intervals) revisited. In: Bruynooghe, M. (Editor), Logic Programming - Proceedings of the 1994 International Symposium, MIT Press, 124-138.
25. Faltings, B., Gelle, E. (1997) Local consistency for ternary numeric constraints. Proceedings 11th International Joint Conference on Artificial Inelligence (IJCAI-97), 392-397.
26. Sabin, D., Freuder, E. (1994) Contradicting conventional wisdom in constraint satisfaction. In: Borning, A. (Editor), Principles and Practice of Constraint Programming: Lecture Notes in Computer Science 874. Springer-Verlag.
27. Benhamou, F. (1996) Heterogeneous constraint solving. In: Hanus, M., Rodríguez-Artalejo, M. (Editors), Algebraic and Logic Programming, 5th International Conference (ALP-'96) Aachen, Germany, 62-76. Springer-Verlag.
28. Bessière, C., Régin, J.-C. (1996) Mac and combined heuristics: two reasons to forsake fc (and cbj). In: Freuder, E., Jampel, M. (Editors), Principles and Practice of Constraint Programming: Lecture Notes in Computer Science 1118. Springer-verlag.
29. Moore, R.E. (1979) Methods and Applications of Interval Analysis. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
30. Van Hentenryck, P., Micher, L., Deville, Y. (1997) Numerica. A modeling language for global optimization. MIT Press.
31. Kondrak, G. (1994) A theoretical evaluation of selected backtracking algorithms. Technical Report TR-94-10, University of Alberta.