Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
sav08:eager_sat_encoding [2009/05/06 00:39] vkuncak |
sav08:eager_sat_encoding [2012/05/21 10:57] vkuncak |
||
---|---|---|---|
Line 2: | Line 2: | ||
Instead of combining DPLL SAT solver search with decision procedures for conjunctions, for several theories it is possible to encode the entire problem into a propositional formula and then just give it to a SAT solver. | Instead of combining DPLL SAT solver search with decision procedures for conjunctions, for several theories it is possible to encode the entire problem into a propositional formula and then just give it to a SAT solver. | ||
+ | |||
+ | **Ackermann's encoding** | ||
+ | |||
+ | [[sav08:small_solutions_for_quantifier-free_presburger_arithmetic|Small Solutions for PA]] | ||
Some systems based on this approach: | Some systems based on this approach: | ||
Line 12: | Line 16: | ||
* encoding into SAT can be simpler | * encoding into SAT can be simpler | ||
* [[http://www.smtexec.org/exec/|some results]] | * [[http://www.smtexec.org/exec/|some results]] | ||
+ | |||
+ | Generalization when sharing more than equalities: | ||
+ | * [[http://lara.epfl.ch/~kuncak/papers/WiesETAL09CombiningTheorieswithSharedSetOperations.html|On Combining Theories with Shared Set Operations]] | ||