Improving tree decomposition methods with function filtering

Authors:
Martí Sánchez;Javier Larrosa;Pedro Meseguer
Affiliations:
IIIA-CSIC, Bellaterra, Spain;Dep. LSI, UPC, Barcelona, Spain;IIIA-CSIC, Bellaterra, Spain
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 3
Cited 2

Tree clustering for constraint networks (research note)

Artificial Intelligence
Node and arc consistency in weighted CSP

Eighteenth national conference on Artificial intelligence
Constraint Processing

Constraint Processing

Improving DPOP with function filtering

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tree decomposition can solve weighted CSP, but with a high spatial complexity. To improve its practical usage, we present function filtering, a strategy to decrease memory consumption. Function filtering dtects and removes some tuples that appear to be consistent but that will become inconsistent when extended to other variables. We show empirically the benefits of our approach.