Enhancing Constraint Propagation with Composition Operators

Simple item page
dc.creatorGranvilliers, Laurent
dc.creatorMonfroy, Eric
dc.date2001-07-02
dc.date.accessioned2026-07-07T03:17:18Z
dc.date.available2026-07-07T03:17:18Z
dc.descriptionConstraint 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).
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/cs/0107002
dc.identifierhttp://arxiv.org/abs/cs/0107002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30675
dc.subjectArtificial Intelligence
dc.subjectF.4.1; D.3.3
dc.titleEnhancing Constraint Propagation with Composition Operators
dc.typetext

Files

Collections

arXiv