New structural decomposition techniques for Constraint Satisfaction Problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3419 LNAI, Issue , 2005, Pages 113-127

  Zheng, Yaling ^a   Choueiry, Berthe Y ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; DATA STRUCTURES; HINGES; PROBLEM SOLVING;

COMPUTATIONAL COST; CONSTRAINT SATISFACTION PROBLEMS; HINGE DECOMPOSITION;

CONSTRAINT THEORY;

EID: 26844478291     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11402763_9     Document Type: Conference Paper

References (11)

1. Dechter, R., Pearl, J.: Tree Clustering for Constraint Networks. Artificial Intelligence 38 (1989) 353-366
2. Gyssens, M., Jeavons, P.G., Cohen, D.A.: Decomposing Constraint Satisfaction Problems Using Database Techniques. Artificial Intelligence 66 (1994) 57-89
3. Jeavons, P.G., Cohen, D.A., Gyssens, M.: A Structural Decomposition for Hypergraphs. Contemporary Mathematics 178 (1994) 161-177
4. Gottlob, G., Leone, N., Scarcello, F.: A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124 (2000) 243-282
5. Freuder, E.C.: A Sufficient Condition for Backtrack-Free Search. JACM 29 (1) (1982) 24-32
6. Freuder, E.C.: A Sufficient Condition for Backtrack-Bounded Search. JACM 32 (4) (1985) 755-761
7. Gottlob, G., Leone, N., Scarcello, F.: Hypertree Decompositions and Tractable Queries. Journal of Computer and System Sciences 64 (2002) 579-627
8. th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 03). (2003) 474-481
9. Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)
10. th International Conference and Workshop on Database and Expert System Applications (DEXA 1999). (1999) 1-15
11. th ECAI, Lyon, France (2002) 161-165