DPLL is a backtracking-based algorithm that combines unit propagation and pure literal elimination. It explores all possible variable assignments until it finds a solution or proves the formula is ...
This project implements a SAT solver using the DPLL algorithm with Conflict-Driven Clause Learning (CDCL) and Variable State Independent Decaying Sum (VSIDS) heuristics in C++. It is designed to read ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results