Partially defined constraints in constraint-based design

Artificial Intelligence for Engineering Design, Analysis and Manufacturing: AIEDAM

Volumn 20, Issue 4, 2006, Pages 297-311

  Lallouet, Arnaud ^a   Legtchenko, Andreï ^a  

^a UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Computer aided design; Constraint programming; Machine learning

Indexed keywords

COMPUTER SIMULATION; CONSTRAINT THEORY; CUSTOMER SATISFACTION; KNOWLEDGE ACQUISITION; LEARNING SYSTEMS;

CONSTRAINT PROGRAMMING; MECHANICAL CONSTRAINTS; PROPAGATORS;

COMPUTER AIDED DESIGN;

EID: 33947411916     PISSN: 08900604     EISSN: 14691760     Source Type: Journal    
DOI: 10.1017/S0890060406060227     Document Type: Article

References (24)

1. Abdennadher, S. & Rigotti, C. (2004). Automatic generation of rule-based constraint solvers over finite domains. Transactions on Computational Logic 5(2).
2. Alberti, M., Gavanelli, M., Lamma, E., Mello, P., & Milano, M. (in press). A chr-based implementation of known arc-consistency. Theory and Practice of Logic Programming.
3. Apt, K.R. (1999). The essence of constraint propagation. Theoretical Computer Science 221(1-2), 179-210.
4. Apt, K.R. & Monfroy, E. (1999). Automatic generation of constraint propagation algorithms for small finite domains. In Int. Conf. Principles and Practice of Constraint Programming, Lecture Notes in Computer Science (Joxan, J., Ed.), Vol. 1713, pp. 58-72, Alexandria, VA. New York: Springer.
5. Bessière, C., Coletta, R., Freuder, E.C., & O'Sullivan, B. (2004). Leveraging the learning power of examples in automated constraint acquisition. In Principles and Practice of Constraint Programming, Lecture Notes in Computer Science (Wallace, M., Ed.), Vol. 3258, pp. 123-137, Toronto. New York: Springer.
6. Bessière, C., Hebrard, E., Hnich, B., & Walsh, T. (2004). The complexity of global constraints. In National Conf. Artificial Intelligence (McGuiness, D.L., & Ferguson, G., Eds.), pp. 112-117. San Jose, CA, July 25-29, 2004. Menlo Park, CA: AAAI Press/MIT Press.
7. Bessière, C. & Régin, J.-C. (1997). Arc-consistency for general constraint networks: preliminary results. In IJCAI, pp. 398-404, Nagoya, San Francisco, CA: Morgan Kaufmann.
8. Chandrasekaran, B. (1999). Design problem solving: a task analysis. AI Magazine 11(4), 59-71.
9. Coletta, R., Bessière, C., O'Sullivan, B., Freuder, E.C., O'Connell, S., & Quinqueton, J. (2003). Semi-automatic modeling by constraint acquisition. In Int. Conf. Principles and Practice of Constraint Programming, Lecture Notes in Computer Science (Rossi, F., Ed.), Vol. 2833, pp. 812-816, Kinsale, Ireland. New York: Springer.
10. Davenport, A., Tsang, E., Wang, C., & Zhu, K. (1994). GENET: a connectionist architecture for solving constraint satisfaction problems by iterative improvement. In National Conf. Artificial Intelligence, pp. 325-330, Seattle, WA. Menlo Park, CA: AAAI Press.
11. Faltings, B. & Macho-Gonzalez, S. (2002). Open constraint satisfaction. In Int. Conf. Principles and Practice of Constraint Programming, Lecture Notes in Computer Science (van Hentenryck, P., Ed.), Vol. 2470, pp. 356-370, Ithaca, NY, September 7-13, 2002. New York: Springer.
12. Freund, Y. & Shapire, R. (1999). A short introduction to boosting. Journal of the Japanese Society for Artificial Intelligence 14(5), 771-780.
13. Hornik, K., Stinchcombe, M., & White, H. (1989). Multilayer feedforward networks are universal approximators. Neural Networks 2(5), 359-366.
14. Lallouet, A., Dao, T.B.H., Legtchenko, A., & Ed-Dbali, A. (2003). Finite domain constraint solver learning. In Int. Joint Conf. Artificial Intelligence (Gottlob, G., Ed.), pp. 1379-1380, Acapulco, Mexico. Menlo Park, CA: AAAI Press.
15. Lallouet, A., Legtchenko, A., Monfroy, E., & Ed-Dbali, A. (2004). Solver learning for predicting changes in dynamic constraint satisfaction problems. In Changes'04, Int. Workshop on Constraint Solving Under Change and Uncertainty (Brown, K., Beck, C., & Verfaillie, G., Eds.), Toronto.
16. Mitchell, T.M. (1997). Machine Learning. New York: McGraw-Hill.
17. Moore, R.E. (1966). Interval Analysis. Englewood Cliffs, NJ: Prentice Hall.
18. O'Sullivan, B. (2002). Constraint-Aided Conceptual Design. London: Professional Engineering Publishing.
19. Rossi, F. & Sperduti, A. (2004). Acquiring both constraint and solution preferences in interactive constraint system. Constraints 9(4).
20. RuleQuest Research. (2004). See5:An informal tutorial. Available on-line at http://www.rulequest.com/see5-win.html
21. Rumelhart, D.E., Hinton, G.E., & Williams, R.J. (1986). Learning internal representations by error propagation. Parallel Distributed Processing 1, 318-362.
22. van Hentenryck, P., Saraswat, V., & Deville, Y. (1991). Constraint processing in cc(fd). Unpublished manuscript.
23. Verfaillie, G. & Jussien, N. (2003). Dynamic constraint solving. CP'2003 Tutorial. Unpublished manuscript.
24. Yorke-Smith, N. & Gervet, C. (2003). Certainty closure: A framework for reliable constraint reasoning with uncertainty. In 9th Int. Conf. Principles and Practice of Constraint Programming, Lecture Notes in Computer Science (Rossi, F., Ed.), Vol. 2833, pp. 769-783, Cork, Ireland. New York: Springer.