Login / Signup
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers.
Steffen Hölldobler
Norbert Manthey
Tobias Philipp
Peter Steinke
Published in:
POS@SAT (2014)
Keyphrases
</>
sat solvers
clause learning
sat encodings
propositional logic
orders of magnitude
propositional satisfiability
boolean formula
first order logic
constraint satisfaction
search tree
simulated annealing
genetic algorithm
knowledge representation
domain specific
answer sets