A simple SAT solver that implements the DPLL algorithm with unit resolution
-
Updated
Sep 10, 2019 - C
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
A small SAT solver implementation. 2020年度の情報科学特別演習にて書いたプログラム
Parallel SAT Solver
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
Yet Another Sat solvER
This repository for implementations of Artificial intelligence algorithms
Solving Wumpus World Problem using Propositional Logic
A library written in Haskell that determines whether a logical argument is valid through either Model Checking or DPLL Algorithm
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)
Add a description, image, and links to the dpll-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the dpll-algorithm topic, visit your repo's landing page and select "manage topics."