Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, we present an approach to decrease memory consumtion in tree decomposition methods, a class of complete inference algorithms. This approach, called function filtering, allows to detect and remove some tuples that appear to be consistent (with a cost below the upper bound) but that will become inconsistent (with a cost exceeding the upper bound) when extended to other variables. Using this idea, we have developed new algorithms CTEf, MCTEf and IMCTEf, standing for cluster, mini-cluster and iterative mini-cluster tree elimination with function filtering. We demonstrate empirically the benefits of our approach.
KeywordsTree Decomposition Constraint Optimization Problem Crossword Puzzle Valuation Structure Complete Inference
Unable to display preview. Download preview PDF.
- 3.Bertele, U., Brioschi, F.: Nonserial Dynamic Programming. AC. Press (1972)Google Scholar
- 5.de Givry, S., Verfaillie, G., Schiex, T.: Bounding the optimum of constraint optimization problems. In: Proceedings of the 3th Conference on Principles and Practice of Constraint Programming, Schloss Hagenberg, Austria, pp. 405–419Google Scholar
- 6.Dechter, R.: Constraint Processing. Elsevier, Amsterdam (2003)Google Scholar
- 7.Dechter, R., Kask, K., Larrosa, J.: A general scheme for multiple lower bound computation in constraint optimization. In: Proceedings of the 6th Conference on Principles and Practice of Constraint Programming, pp. 346–360 (2001)Google Scholar
- 9.Dechter, R., Pearl, J.: Tree clustering for constraints networks. Artifical Intelligence 38 (1989)Google Scholar
- 11.Larkin, D., Dechter, R.: Bayesian inference in the presence of determinism (2003)Google Scholar
- 13.Larrosa, J.: Node and arc consistency in weighted csp. In: Proc. AAAI (2002)Google Scholar
- 14.Larrosa, J., Morancho, E., Niso, D.: On the practical applicability of bucket elimination: Still-life as a case study. Journal of Artificial Intelligence Research (2005)Google Scholar
- 15.Larrosa, J., Schiex, T.: Solving weighted csp by maintaining arc consistency. Artificial Intelligence 159 (2004)Google Scholar
- 16.Sanchez, M., Meseguer, P., Larrosa, J.: Improving the applicability of adaptive consistency. In: Proceedings of the 10th Conference on Principles and Practice of Constraint Programming, Toronto, Canda (2004)Google Scholar