There are 2 repositories under dpll-algorithm topic.
A simple SAT solver that implements the DPLL algorithm with unit resolution
华中科技大学数据结构课程设计2018 An algorithm to solve SAT problem
Simple Python implementation of a Complete/Systematic SAT Solver with the DPLL algorithm
Parallel SAT Solver
A small SAT solver implementation. 2020年度の情報科学特別演習にて書いたプログラム
Modelling n-queens problem as conjunctive normal form and solving it with DPLL algorithm. This project should made me familiar with Rust and the test driven approach.
Python Implemetation of DPLL algorithm to solve Boolean Satisfiability problem
Simple Java implementation of the Davis–Putnam–Logemann–Loveland (DPLL) algorithm
Flamegraph tutorial for my classes
Yet Another Sat solvER
This repository for implementations of Artificial intelligence algorithms
A library written in Haskell that determines whether a logical argument is valid through either Model Checking or DPLL Algorithm
A collection of scripts by me.
Solving Wumpus World Problem using Propositional Logic
An implementation of a recursive DPLL solver in OCaml. It parses setup (cnf ) DIMACS and checks if the formula is satisfied.
Nothing more than a SAT Solver and a Twodoku Game
Demonstration of DPLL + backjumping (learning clauses)
Advanced Algorithms | Spring 2021 | DPLL SAT solver for Sudoku
A Sudoku solver with a custom DPLL decision procedure.
SAT Solver based on DPLL algorithm and Jersolow-Wang 2-sided heuristic. Sudoku Pair Solver and Generator using SAT Solver.
Boolean SAT Solver implemented using the C++ Standard Library
Solucionador de Sudokus usando lógica proposicional, a través de algoritmos como el 'DPLL' y la transformación de 'Tseitin'
A DPLL-based SAT solver written in TypeScript, powered by Bun.
[alpha] An implementation of several classic transition systems that describe algorithms for SAT or SMT, for interactive exploration
A DPLL sat solver accelerated by clause-driven-conflict-learning algorithm.
🧩 Solver for N-Puzzle & N-Queens using Genetic Algorithms, A*, and more in Python
Sat-Solver is a Prolog program that converts propositional logic formulas into CNF and solves them using the DPLL algorithm. It processes logical expressions and applies unit propagation, clause simplification, and variable branching. The project was mainly built to improve skills in Prolog.
Simple implementation and parallelization of the DPLL algorithm for the satisfiability problem.
C++ SAT solver using DPLL and CDCL algorithms to solve Boolean SAT problems supporting pure literal elimination, unit propagation, clause learning, and non-chronological backtracking.
This program checks if an input CNF is satisfiable or not to check logical entailment.
A SAT solver using DPLL algorithm.