Boosting search with variable elimination

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

Volumn 1894, Issue , 2000, Pages 291-305

  Larrosa, Javier ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ADAPTIVE CONSISTENCY; EXPERIMENTAL EVIDENCE; HYBRID ALGORITHMS; SEARCH PROCEDURES; SPACE AND TIME COMPLEXITY; STATE-OF-THE-ART ALGORITHMS; STRUCTURAL PARAMETER; VARIABLE ELIMINATION;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84945978977     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45349-0_22     Document Type: Conference Paper

References (12)

1. D. Achlioptas, L. M. Kirousis, E. Kranakis, D. Krizanc, M. S. O. Molloy and C. Stamatious. Random constraint satisfaction: A more accurate picture.CP’97, 1997.
2. S. A. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey. BIT, 25: 2-23, 1985.
3. C. Bessiere. Arc-Consistency and Arc-Consistency Again. Artificial Intelligence, 65(1): 179-190, 1994.
4. R. Dechter and J. Pearl. Tree Clustering for Constraint Networks. Artificial Intelligence, 38: 353-366, 1989.
5. R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113: 41-85, 1999.
6. E. C. Freuder and R. J. Wallace. Partial Constraint Satisfaction Artificial Intelligence, 58: 21-70, 1992.
7. R. M. Haralick and G. L. Elliot. Increasing tree seach efficiency for constraint satisfaction problems. Artificial Intelligence, 14: 263-313, 1980.
8. J. Larrosa, P. Meseguer and T. Schiex. Maintaining Reversible DAC for Max-CSP. Artificial Intelligence, 107: 149-163, 1998.
9. J. Larrosa and R. Dechter. Dynamic Combination of Search and Variable Elimination in CSP and Max-CSP. available at http://www.ics.uci.edu/~dechter.
10. B. Nudel. Tree search and arc consistency in constraint satisfaction algorithms. L. N. Kanal and V. Kumar, editors, Search in Artifical Intelligence, 287-342, Springer-Verlag, 1988.
11. B. M. Smith. Phase transition and mushy region in constraint satisfaction problems. In Proceedings of ECAI’94. pp. 100-104. 1994.
12. I. Rish and R. Dechter. Resolution vs. SAT: two approaches to SAT To appear in Journal of Approximate Reasoning. Special issue on SAT.