SATUZK: solver description. satUZK is a conflict-driven clause learning solver for the boolean satisfiability problem (SAT). It is written in C++ from scratch and aims to be flexible and easily extendable. In addition to the standard DPLL  algorithm with clause learning the solver is able to perform various preprocessing and inprocessing techniques.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Li, Chu-Min; Xiao, Fan; Luo, Mao; Manyà, Felip; Lü, Zhipeng; Li, Yu: Clause vivification by unit propagation in CDCL SAT solvers (2020)
- Lindauer, Marius; Hoos, Holger; Leyton-Brown, Kevin; Schaub, Torsten: Automatic construction of parallel portfolios via algorithm configuration (2017)
- Oh, Chanseok: Between SAT and UNSAT: the fundamental difference in CDCL SAT (2015)
- Porschen, Stefan; Schmidt, Tatjana; Speckenmeyer, Ewald; Wotzlaw, Andreas: XSAT and NAE-SAT of linear CNF classes (2014)