Preprocessing in incremental SAT

Authors:
Alexander Nadel;Vadim Ryvchin;Ofer Strichman
Affiliations:
Design Technology Solutions Group, Intel Corporation, Haifa, Israel;Design Technology Solutions Group, Intel Corporation, Haifa, Israel, Information Systems Engineering, IE, Technion, Haifa, Israel;Information Systems Engineering, IE, Technion, Haifa, Israel
Venue:
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Year:
2012

Citing 5
Cited 2

SATIRE: a new incremental satisfiability engine

Proceedings of the 38th annual Design Automation Conference
Pruning Techniques for the SAT-Based Bounded Model Checking Problem

CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Applying SMT in symbolic execution of microcode

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Incremental preprocessing methods for use in BMC

Formal Methods in System Design
Effective preprocessing in SAT through variable and clause elimination

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing

The MathSAT5 SMT solver

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Factoring out assumptions to speed up MUS extraction

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.