gradient-based symbolic execution engine implemented from scratch
Yet Another Sat solvER
A DPLL-based SAT solver written in TypeScript, powered by Bun.
An implementation of a recursive DPLL solver in OCaml. It parses setup (cnf ) DIMACS and checks if the formula is satisfied.
Simple SAT solver implementation using python. It also includes a BNF to CNF converter
Solveur DPLL récursif pour CNF en OCaml. Implémentation complète avec tests unitaires et exécution d'exemples SAT/UNSAT. Méthodologie claire et code commenté.
Implementation of CDCL SAT solver in Python
Implémentation d'un Solveur DPLL Récursif
DPLL SAT solver implementation exploring phase transitions in random 3-SAT instances.
NYU Artificial Intelligence Course Lab 2: A BNF to CNF converter and generic DPLL solver
Simple SMT solver based on DPLL algorithm
SAT solver (DPLL) for DIMACS CNF, with folder solving and benchmark export.
This program calculates the DPLL Algorithm for you. It is basically a SAT Solver for CNF's. There are three main reasons why I made this program. firstly I wanted to better learn python, secondly I would learn the DPLL algorithm better and thirdly and most importantly I can use it in the exam to gain some time. But I would never do something lik…
Simple DPLL-based solver with unit-propagation rule
A Python Implementation of the DPLL Algorithm Inspired by MiniSAT
Benchmarks of SomeSAT SAT-solver.
Add a description, image, and links to the dpll-solver topic page so that developers can more easily learn about it.
To associate your repository with the dpll-solver topic, visit your repo's landing page and select "manage topics."