Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers

Aus International Center for Computational Logic
Version vom 15. Dezember 2016, 22:41 Uhr von Serge Stratan (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Tobias |ErsterAutorNachname=Philipp }} {{Misc |Title=Generic CDCL - A Formalization of Modern Propositional Sati…“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
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
Stavropol, Russian Federation - Young Scientists' International Workshop on Trends in Information Processing, April 2014
@misc{P2014,
  author = {Tobias Philipp},
  title  = {Generic {CDCL} - A Formalization of Modern Propositional
            Satisfiability Solvers},
  year   = {2014},
  month  = {April}
}