Tree decomposition with function filtering

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

Volumn 3709 LNCS, Issue , 2005, Pages 593-606

  Sánchez, Martí ^a   Larrosa, Javier ^b   Meseguer, Pedro ^a  

^a CSIC   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; CONSTRAINT THEORY; ITERATIVE METHODS; PROBLEM SOLVING; TREES (MATHEMATICS);

FUNCTION FILTERING; INFERENCE ALGORITHMS; MINI CLUSTER; TREE DECOMPOSITION;

FUNCTION EVALUATION;

EID: 33646198590     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_44     Document Type: Conference Paper

References (16)

1. http://carlit.toulouse.inra.fr/cgi-bin/awki.cgi/softcsp.
2. http://www.nmt.edu/~borchers/maxsat.html.
3. U. Bertele and F. Brioschi. Nonserial Dynamic Programming. AC. Press, 1972.
4. B. Gabon, S; Givry, and G. Verfaillie. Anytime lower bounds for constraint violation minimization problems. In Proceedings of the 4th Conference on Principles and Practice of Constraint Programming, volume 1520, pages 117-131, 1998.
5. S. de Givry, G. Verfaillie, and T. Schiex. Bounding the optimum of constraint optimization problems. In Proceedings of the 3th Conference on Principles and Practice of Constraint Programming, pages 405-419, Schloss Hagenberg, Austria.
6. R Dechter. Constraint Processing. Elsevier, 2003.
7. R. Dechter, K. Kask, and J. Larrosa. A general scheme for multiple lower bound computation in constraint optimization. In Proceedings of the 6th Conference on Principles and Practice of Constraint Programming, pages 346-360, 2001.
8. R. Dechter and J. Pearl. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence, 34:1-38, 1987.
9. R. Dechter and J. Pearl. Tree clustering for constraints networks. Artifical Intelligence, 38, 1989.
10. Rina Dechter. Bucket elimination: A unifying framework for reasoning. Artifical Intelligence, 113:41-85, 1999.
11. D.Larkin and R.Dechter. Bayesian inference in the presence of determinism. 2003.
12. E.Bensana, M.Lemaitre, and G.Verfaillie. Earth observation satellite management. Constraints, 4:293-299, 1999.
13. J.Larrosa. Node and arc consistency in weighted csp. In Proc. AAAI, 2002.
14. J.Larrosa, E.Morancho, and D.Niso. On the practical applicability of bucket elimination: Still-life as a case study. Journal of Artificial Intelligence Research, 2005.
15. J. Larrosa and T. Schiex. Solving weighted csp by maintaining arc consistency. Artificial Intelligence, 159, 2004.
16. M. Sanchez, P. Meseguer, and J. Larrosa. Improving the applicability of adaptive consistency. In Proceedings of the 10th Conference on Principles and Practice of Constraint Programming, Toronto, Canda, 2004.