Decomposition During Search for Propagation-Based Constraint Solvers

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically decomposes sub-problems of a constraint satisfaction problem into independent partial problems, avoiding redundant work. The paper discusses how DDS interacts with key features that make propagation-based solvers successful: constraint propagation, especially for global constraints, and dynamic search heuristics. We have implemented DDS for the Gecode constraint programming library. Two applications, solution counting in graph coloring and protein structure prediction, exemplify the benefits of DDS in practice.
20 pages, 9 figures, 2 tables; longer, more detailed version

Keywords

Artificial Intelligence

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/162575

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0712.2389
 http://arxiv.org/abs/0712.2389

Collections

arXiv