Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
sav08:finite-model_finders [2008/03/13 13:13] vkuncak |
sav08:finite-model_finders [2008/03/13 13:24] vkuncak |
||
---|---|---|---|
Line 16: | Line 16: | ||
* generalize SAT algorithms to search for finite domains and not just propositional ones (SEM) | * generalize SAT algorithms to search for finite domains and not just propositional ones (SEM) | ||
* encoding into SAT (popular recently because SAT solvers are good): MACE, Paradox, KodKod (used in Alloy) | * encoding into SAT (popular recently because SAT solvers are good): MACE, Paradox, KodKod (used in Alloy) | ||
+ | |||
+ | Issues when encoding into SAT: | ||
+ | * detecting sharing to minimizing size of propositional formula | ||
+ | * symmetry breaking - larger formula with fewer instances | ||
+ | * sort inference - smaller range of variables | ||
+ | * incremental search for different sizes of the domain - reusing work in SAT solver | ||
Symmetry breaking among issues of encoding into SAT. | Symmetry breaking among issues of encoding into SAT. |