This program checks if an input CNF is satisfiable or not to check logical entailment.
-
Updated
Nov 19, 2020 - Jupyter Notebook
This program checks if an input CNF is satisfiable or not to check logical entailment.
Iterative DPLL SAT Solver with occurrence lists, jeroslow-wang heuristic
ECE 208 Bonus Assignment
A simple Haskell-based DPLL solver that reads and writes to standard input/output.
DPLL_propositional_logical_inference: Starting from a FNC (Conjunctive Normal Form), that is, a series of clauses (literals joined by the or operator) joined by an and operator. Apply the DPLL algorithm and determine the values of the literals that give a solution to the FNC. A clear explanation of the DPLL algorithm can be found at http://www…
Touching upon Search, Propositional Logic, RL, NLP
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…
A (parallel) implementation of the classic DPLL algorithm using Cilk
SAT Solver NPM Package written in C++
Graph-based DPLL-SAT Solver for propositional logic formulas in XOR-OR-AND normal form (XNF).
DPP and DPLL algorithms
A python implementation of the DPLL algorithm
Add a description, image, and links to the dpll topic page so that developers can more easily learn about it.
To associate your repository with the dpll topic, visit your repo's landing page and select "manage topics."