This project is my independent research into SAT solvers written entirely in Python, designed to explore the theory and practice of propositional satisfiability. It begins with a baseline DPLL ...
For fun, I recently tried "vibe coding" an implementation of DPLL using different LLMs. Each one produced a seemingly correct implementation of DPLL, which seemed to pass some of the basic tests, ...
Mastering the DPLL Algorithm: A Cornerstone of SAT Solvers In the realm of artificial intelligence and computational logic, the DPLL (Davis-Putnam-Logemann-Loveland) algorithm stands as a pivotal ...
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