TY - GEN
T1 - Preprocessing in incremental SAT
AU - Nadel, Alexander
AU - Ryvchin, Vadim
AU - Strichman, Ofer
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84864259135&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-31612-8_20
DO - 10.1007/978-3-642-31612-8_20
M3 - منشور من مؤتمر
SN - 9783642316111
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 256
EP - 269
BT - Theory and Applications of Satisfiability Testing, SAT 2012 - 15th International Conference, Proceedings
T2 - 15th International Conference on Theory and Applications of Satisfiability Testing, SAT 2012
Y2 - 17 June 2012 through 20 June 2012
ER -