A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

Blanchette, Jasmin Christian; Fleury, Mathias; Lammich, Peter; Weidenbach, Christoph

doi:10.1007/s10817-018-9455-7

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2602035_3

DetailsSummary

Released

Journal Article

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

MPS-Authors

/persons/resource/persons183227

Blanchette, Jasmin Christian
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons141910

Fleury, Mathias
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45719

Weidenbach, Christoph
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

s10817-018-9455-7.pdf
(Publisher version), 575KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Blanchette, J. C., Fleury, M., Lammich, P., & Weidenbach, C. (2018). A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. Journal of Automated Reasoning, 61(1-4), 333-365. doi:10.1007/s10817-018-9455-7.

Cite as: https://hdl.handle.net/21.11116/0000-0001-7ADB-0

Abstract

There is no abstract available