Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers
From International Center for Computational Logic
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers
Tobias PhilippTobias Philipp
![Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers](/w/images/thumb/e/e2/Missing_document_icon.png/150px-Missing_document_icon.png)
Tobias Philipp
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers
Vienna Austria - Pragmatics of SAT 2014, July 2014
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers
Vienna Austria - Pragmatics of SAT 2014, July 2014
- Forschungsgruppe:Research Group: WissensverarbeitungKnowledge Representation and Reasoning
@misc{P2014,
author = {Tobias Philipp},
title = {Generic {CDCL} - A Formalization of Modern Propositional
Satisfiability Solvers},
year = {2014},
month = {July}
}