CaDiCaL

CaDiCaL Simplified Satisfiability Solver: The goal of CaDiCaL is to provide a clean and efficient state-of-the-art CDCL solver, which is also easy to understand and change

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 5 articles )

Showing results 1 to 5 of 5.
Sorted by year (citations)

  1. Li, Chu-Min; Xiao, Fan; Luo, Mao; Manyà, Felip; Lü, Zhipeng; Li, Yu: Clause vivification by unit propagation in CDCL SAT solvers (2020)
  2. Semenov, Alexander; Otpuschennikov, Ilya; Gribanova, Irina; Zaikin, Oleg; Kochemazov, Stepan: Translation of algorithmic descriptions of discrete functions to SAT with applications to cryptanalysis problems (2020)
  3. Kauers, Manuel; Seidl, Martina; Zeilberger, Doron: On the maximal minimal cube lengths in distinct DNF tautologies (2019)
  4. Kiesl, Benjamin; Heule, Marijn J. H.; Biere, Armin: Truth assignments as conditional autarkies (2019)
  5. Semenov, Alexander A.: Merging variables: one technique of search in pseudo-Boolean optimization (2019)