DMCA
Handling Heterogeneous Constraints in Revision Ordering Heuristics
| Citations: | 1 - 1 self |
BibTeX
@MISC{Vion_handlingheterogeneous,
author = {Julien Vion and Sylvain Piechowiak},
title = {Handling Heterogeneous Constraints in Revision Ordering Heuristics},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Most constraint solvers use the general AC-5 scheme [17] to handle constraint propagation. AC-5 generalizes the concept of constraint revision. Each constraint type can thus be shipped with its own revision algorithm, with various complexities and performances. Previous papers showed that the order in which constraints are revised have a non-negligible impact on performances of propagation [20,6,1]. However, most of the ideas presented on these papers are based on the use of homogeneous propagators for binary constraints defined in extension. This paper give ideas to handle heterogeneous constraints in a general revision schedule. 1
Keyphrases
heterogeneous constraint revision ordering heuristic general ac-5 scheme constraint revision previous paper various complexity non-negligible impact constraint propagation constraint type constraint solver revision algorithm homogeneous propagator general revision schedule binary constraint
