Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Toggle side column

Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers

Tobias PhilippTobias Philipp
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers


Tobias Philipp
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers
Vienna Austria - Pragmatics of SAT 2014, July 2014
@misc{P2014,
  author = {Tobias Philipp},
  title  = {Generic {CDCL} - A Formalization of Modern Propositional
            Satisfiability Solvers},
  year   = {2014},
  month  = {July}
}