"Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers."

Steffen Hölldobler et al. (2014)

> Home

Details and statistics

DOI: 10.29007/7N71

access: open

type: Conference or Workshop Paper

metadata version: 2021-08-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/sat/HolldoblerMPS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/HolldoblerMPS14
Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke:
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers. POS@SAT 2014: 89-102

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.