Preprocessing in Incremental SAT
Preprocessing of CNF formulas is an invaluable technique when attempting to solve large formulas, such as those that model industrial verification problems. Unfortunately, the best combination of preprocessing techniques, which involve variable elimination combined with subsumption, is incompatible with incremental satisfiability. The reason is that soundness is lost if a variable is eliminated and later reintroduced. Look-ahead is a known technique to solve this problem, which simply blocks elimination of variables that are expected to be part of future instances. The problem with this technique is that it relies on knowing the future instances, which is impossible in several prominent domains. We show a technique for this realm, which is empirically far better than the known alternatives: running without preprocessing at all or applying preprocessing separately at each step.
Unable to display preview. Download preview PDF.
- 6.Franzén, A., Cimatti, A., Nadel, A., Sebastiani, R., Shalev, J.: Applying smt in symbolic execution of microcode. In: FMCAD, pp. 121–128 (2010)Google Scholar
- 8.Nadel, A., Ryvchin, V., Strichman, O.: Preprocessing in incremental SAT. Technical Report IE/IS-2012-02, Industrial Engineering, Technion (2012), http://ie.technion.ac.il/~ofers/publications/sat12t.pdf
- 10.Whittemore, J., Kim, J., Sakallah, K.: SATIRE: a new incremental satisfiability engine. In: IEEE/ACM Design Automation Conference, DAC (2001)Google Scholar