Two techniques to improve Finite Model Search
Gilles Audemard, Belaïd Benhamou, Laurent Hénocque · 2000
. This article introduces two techniques to improve the propagation eciency of CSP based nite model generation methods. One approach consists in statically rewriting some selected clauses so as to trigger added constraint propagations. The other approach uses a dynamic lookahead strategy to both lter out inconsistent domain values and select the most appropriate branching variable according to a rst fail heuristic. 1