Two Techniques to Improve Finite Model Search

Abstract. 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.

• Type: Conference
• Year: 2000
• Where: CADE
• Authors: Gilles Audemard, Belaid Benhamou, Laurent Henocque
• Keywords: Added Constraint Propagations, CADE 2000, Dynamic Lookahead Strategy, Inconsistent Domain Values, Logical Reasoning