@inproceedings{9da5e20be55342bd8b0bb015a3f1095c,
title = "Incremental Inprocessing SAT Solving",
abstract = "Incremental SAT is about solving a sequence of related SAT problems efficiently. It makes use of already learned information to avoid repeating redundant work. Also preprocessing and inprocessing are considered to be crucial. Our calculus uses the most general redundancy property and extends existing inprocessing rules to incremental SAT solving. It allows to automatically reverse earlier simplification steps, which are inconsistent with literals in new incrementally added clauses. Our approach to incremental SAT solving not only simplifies the use of inprocessing but also substantially improves solving time.",
author = "Katalin Fazekas and Armin Biere and Christoph Scholl",
year = "2019",
month = jul,
language = "English",
isbn = "978-3-030-24257-2",
volume = "11628",
series = "Lecture Notes in Computer Science (LNCS)",
publisher = "Springer",
pages = "136--154",
editor = "\{Mikol{\'a}{\v s} Janota, In{\^e}s Lynce\}",
booktitle = "Proc. 22nd Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'19)",
}