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

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

doi:10.1007/978-3-319-40229-1_4

Item

ITEM ACTIONSEXPORT

Add to Basket

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

DetailsSummary

Released

Conference Paper

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)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Blanchette, J. C., Fleury, M., & Weidenbach, C. (2016). A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. In N. Olivetti, & A. Tiwari (Eds.), Automated Reasoning (pp. 25-44). Berlin: Springer. doi:10.1007/978-3-319-40229-1_4.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002B-01C7-8

Abstract

There is no abstract available