Preprocessing in incremental SAT

Alexander Nadel, Vadim Ryvchin, Ofer Strichman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationTheory and Applications of Satisfiability Testing, SAT 2012 - 15th International Conference, Proceedings
Number of pages14
StatePublished - 2012
Event15th International Conference on Theory and Applications of Satisfiability Testing, SAT 2012 - Trento, Italy
Duration: 17 Jun 201220 Jun 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7317 LNCS


Conference15th International Conference on Theory and Applications of Satisfiability Testing, SAT 2012

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Preprocessing in incremental SAT'. Together they form a unique fingerprint.

Cite this