Generic CDCL – A Formalization of Modern Propositional Satisfiability Solvers
Aus International Center for Computational Logic
Generic CDCL – A Formalization of Modern Propositional Satisfiability Solvers
Steffen HölldoblerSteffen Hölldobler, Norbert MantheyNorbert Manthey, Tobias PhilippTobias Philipp, Peter SteinkePeter Steinke

Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke
Generic CDCL – A Formalization of Modern Propositional Satisfiability Solvers
In Daniel Le Berre, eds., POS-14, volume 27 of EPiC Series, 89-102, 2014. EasyChair
Generic CDCL – A Formalization of Modern Propositional Satisfiability Solvers
In Daniel Le Berre, eds., POS-14, volume 27 of EPiC Series, 89-102, 2014. EasyChair
- Forschungsgruppe:Research Group: WissensverarbeitungKnowledge Representation and Reasoning
@inproceedings{HMPS2014,
author = {Steffen H{\"{o}}lldobler and Norbert Manthey and Tobias Philipp
and Peter Steinke},
title = {Generic {CDCL} {\textendash} A Formalization of Modern
Propositional Satisfiability Solvers},
editor = {Daniel Le Berre},
booktitle = {POS-14},
series = {EPiC Series},
volume = {27},
publisher = {EasyChair},
year = {2014},
pages = {89-102}
}