Compiling CSPs into tree-driven automata for interactive solving

Constraints

Volumn 9, Issue 4, 2004, Pages 263-287

  Fargier, Hélène ^a   Vilarem, Marie Catherine ^b  

^a IRIT   (France)

^b LIRMM   (France)

Author keywords

Configuration; CSP compilation; Interactive constraint solving; Tree automata; Tree clustering

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; TREES (MATHEMATICS);

CSP COMPILATION; INTERACTIVE CONSTRAINT SOLVING; TREE AUTOMATA; TREE CLUSTERING;

CONSTRAINT THEORY;

EID: 18744410142     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:CONS.0000049204.75635.7e     Document Type: Article

References (16)

1. Amilhastre, J. (1999). Représentation par automate de l'ensemble des solutions de problèmes de satisfaction de contraintes. PhD Thesis, Université du Languedoc, Montpellier.
2. Amilhastre, J., Fargier, H., & Marquis, P. (2002). Consistency restoration and explanations in dynamic CSPs - Application to configuration. Artif. Intell. 135: 199-234.
3. Cadoli, M., & Donini, F. M. (1997). A survey on knowledge compilation. AI Commun, 10: 137-150.
4. Darwiche, A., & Marquis. P. (2001). A perspective on knowledge compilation. In Proceedings of the International Joint Conference on Artificial Intelligence 2001, 175-182.
5. Dechter, R., & Pearl, J. (1989). Tree clustering for constraint networks. Artif. Intell. 38: 353-366.
6. Diaz, J., Petit, J., & Sema, M. (2002). A survey of graph layout problems. ACM Comput. Sun: 34(3): 313-356.
7. Ellis, J., Sudborough, I. H., & Turner, J. (1979). The vertex separation and search number of a graph. Inf. Comput 113: 50-79.
8. Gelle, E., & Weigel, R. (1996). Interactive configuration using constraint satisfaction techniques. In Artificial Intelligence and Manufacturing Research Planning Workshop, AAAI Technical Report FS-96-03, 37-44.
9. Hoey, J., St-Aubin, R., Hu, A., & Boutilier, C. (1999). SPUDD: Stochastic planning using decision diagrams. In Proceedings UAI'99. pages 279-288.
10. Pargamin, B. (2003). Extending cluster tree compilation with non-boolean variables in product configuration: A tractable approach to preference-based configuration. In Proceedings of the IJCAI'03 Workshop on Configuration. Acapulco, Mexico.
11. Sabin, D., & Freuder, E.C. (1996). Composite constraint satisfaction. In Artificial Intelligence and Manufacturing Research Planning Workshop, pages 153-161.
12. Sabin, D., & Weigel, R. (1998). Product configuration frameworks - A survey. In IEEE Intelligent Systems and their Applications, pages 42-49.
13. Soininen, T., & Gelle, E. (1999). Dynamic constraint satisfaction in configuration. In Proceedings of the AAAI'99 Workshop on Configuration, 95-100. Orlando, Florida.
14. Stumptner, M. (1997). An overview of knowledge-based configuration. AI Commun. 111-125.
15. Vempaty, N. R. (1992). Solving constraint satisfaction problems using finite state automata. In Proceedings of AAAI'92, pages 453-458.
16. Weigel, R., & Faltings, B. (1999). Compiling constraint satisfaction problems. Artif. Intell 115: 257-287.