Abstract
Variable elimination is the basic step of Adaptive Consistency [4]. It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are many classes of problems for which it is infeasible, due to its exponential space and time complexity. However, by restricting variable elimination so that only low arity constraints are processed and recorded, it can be effectively combined with search, because the elimination of variables, reduces the search tree size.
In this paper we introduce VarElimSearch(S,k), a hybrid meta-algorithm that combines search and variable elimination. The parameter S names the particular search procedure and k controls the tradeoff between the two strategies. The algorithm is space exponential in k. Regarding time, we show that its complexity is bounded by k and a structural parameter from the constraint graph. We also provide experimental evidence that the hybrid algorithm can outperform state-of-the-art algorithms in binary sparse problems. Experiments cover the tasks of finding one solution and the best solution (Max-CSP). Specially in the Max-CSP case, the advantage of our approach can be overwhelming.
This work was carried out while the author was visiting the University of California at Irvine with grant from Generalitat de Catalunya. The author is thankful to Rina Dechter for many useful comments and suggestions on previous versions of this paper. This research is partially funded by the Spanish CICYT under the project TAP1999-1086-C03-03 and by the NSF under grant IIS-9610015.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
S. A. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability-A survey. BIT, 25:2–23, 1985.
C. Bessiere. Arc-Consistency and Arc-Consistency Again. Artificial Intelligence, 65(1):179–190, 1994.
R. Dechter and J. Pearl. Tree Clustering for Constraint Networks. Artificial Intelligence, 38:353–366, 1989.
R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113:41–85, 1999.
E. C. Freuder and R. J. Wallace. Partial Constraint Satisfaction Artificial Intelligence, 58:21–70, 1992.
R. M. Haralick and G. L. Elliot. Increasing tree seach efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263–313, 1980.
J. Larrosa, P. Meseguer and T. Schiex. Maintaining Reversible DAC for Max-CSP. Artificial Intelligence, 107:149–163, 1998.
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.
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.
B. M. Smith. Phase transition and mushy region in constraint satisfaction problems. In Proceedings of ECAI’94. pg. 100–104. 1994.
I. Rish and R. Dechter. Resolution vs. SAT: two approaches to SAT To appear in Journal of Approximate Reasoning. Special issue on SAT.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larrosa, J. (2000). Boosting Search with Variable Elimination. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_22
Download citation
DOI: https://doi.org/10.1007/3-540-45349-0_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41053-9
Online ISBN: 978-3-540-45349-9
eBook Packages: Springer Book Archive