SPASS-SATT - A CDCL(LA) Solver.
Martin BrombergerMathias FleurySimon SchwarzChristoph WeidenbachPublished in: CADE (2019)
Keyphrases
- clause learning
- sat solvers
- sat solving
- unit propagation
- boolean formula
- sat encodings
- search tree
- theorem prover
- satisfiability problem
- sat problem
- orders of magnitude
- max sat
- propositional satisfiability
- conjunctive normal form
- constraint satisfaction
- search strategies
- temporal logic
- search space
- sat instances
- np complete
- branch and bound
- combinatorial problems
- domain independent
- dynamic programming