Enhancing Constraint Propagation with Composition Operators

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Constraint propagation is a general algorithmic approach for pruning the search space of a CSP. In a uniform way, K. R. Apt has defined a computation as an iteration of reduction functions over a domain. He has also demonstrated the need for integrating static properties of reduction functions (commutativity and semi-commutativity) to design specialized algorithms such as AC3 and DAC. We introduce here a set of operators for modeling compositions of reduction functions. Two of the major goals are to tackle parallel computations, and dynamic behaviours (such as slow convergence).
14 pages

Keywords

Artificial Intelligence, F.4.1; D.3.3

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0107002
 http://arxiv.org/abs/cs/0107002

Collections

arXiv