A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Two Techniques to Improve Finite Model Search
[chapter]
2000
Lecture Notes in Computer Science
This article introduces two techniques to improve the propagation efficiency of CSP based finite 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 filter out inconsistent domain values and select the most appropriate branching variable according to a first fail heuristic.
doi:10.1007/10721959_24
fatcat:3jwwnr2mhzebpdmfw6smkyopqq