Two techniques to improve finite model search (2000) [1 citations — 0 self]
Abstract:
Abstract. Finite model generation methods for rst order theories, when based on propositional logic, are very propagation eective, but need a lot of memory. A former work (FMSET [2]) attempted to improve the memory eciency of a propositional approach. This required complex data structures and algorithms. CSP based methods are more memory eective by nature but do not capture all the possible propagations. 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. Because of its eciency and source code availability, we chose to use the nite model generator SEM ([10]) as a software framework. We have obtained order of magnitude improvements on some problems, and successfully solved nite groups of order 30 and more.
Citations
| 49 | Automated reasoning and exhaustive search: Quasigroup existence problems – Slaney, Fujita, et al. - 1995 |
| 35 | Implementing the Davis-Putnam algorithm by tries – Zhang, Stickel - 1994 |
| 4 | Constraint propagation in model generation – Zhang, Zhang - 1995 |
| 2 | Finder : Finite domain enumerator. version 3 notes and guides – Slanley - 1993 |
| 1 | Two techniques to improve nite model search – Audemard, Benhamou, et al. - 1999 |
| 1 | La mthode d'avalanche aval : une mthode numrative pour sat – Audemard, Benhamou, et al. - 1999 |
| 1 | A hybrid method for nite model search in equational theories – Benhamou, Henocque - 1999 |
| 1 | based on unit propagation for satisability problems – Heuristics - 1997 |
| 1 | A new method for automated nite model building exploiting failures and symmetries – Peltier - 1998 |
| 1 | Constructing nite algebras with falcon – Zhang - 1994 |
| 1 | La méthode d’avalanche aval : une méthode énumérative pour sat – Audemard, Benhamou, et al. - 1999 |

