Abstract
We incorporate two ideas in ADC. The first one, delaying variable elimination, permits performing joins in different buckets, not forcing to eliminate one variable before start processing the bucket of another variable. It may cause exponential savings in space. The second idea, join with filtering, consists in taking into account the effect of other constraints when performing the join of two constraints. If a tuple resulting from this join is going to be removed by an existing constraint, this tuple is not produced. It can also produce exponential savings. We have tested these techniques on two classical problems, n-queens and Schur’s lemma, showing very promising benefits.
This research is supported by the REPLI project TIC-2002-04470-C03.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
El Fattah, Y., Dechter, R.: Topological parameters for time-space tradeoff. Artifical Intelligence (2000)
Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural csp decomposition methods. Artificial Intelligence 124(2), 243–282 (2000)
Larrosa, J.: Boosting search with variable elimination. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 291–305. Springer, Heidelberg (2000)
Larrosa, J., Morancho, E.: Solving still life with soft constraints and variable elimination. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 466–479. Springer, Heidelberg (2003)
Kask, K.: New search heuristics for max-csp. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 262–277. Springer, Heidelberg (2000)
Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artifical Intelligence 113, 41–85 (1999)
Dechter, R., Pearl, J.: Network-based heuristics for constraint satisfaction problems. Artifical Intelligence 34, 1–38 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sánchez, M., Meseguer, P., Larrosa, J. (2004). Improving the Applicability of Adaptive Consistency: Preliminary Results. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_61
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive