Implementation of DPLL SAT solver algorithm
-
Updated
Feb 1, 2020 - Python
Implementation of DPLL SAT solver algorithm
Touching upon Search, Propositional Logic, RL, NLP
Automatically checks whether a given propositional formula is satisfiable.
A DPLL-based SAT solver focused on traceability
DPP and DPLL algorithms
Boolean satisfiability problem (SAT), maximum satisfiability problem (MAX-SAT) etc
Part of the SPBU's programming course. DPLL SAT solver in F#.
A simple Haskell-based DPLL solver that reads and writes to standard input/output.
Solutions to Travelling Salesman Problem and the SAT problem using Artificial Intelligence (AI)
This program checks if an input CNF is satisfiable or not to check logical entailment.
Given a relationship matrix among guests, output the seating arrangement. The program converts the relationship matrix into CNF clauses and finds a solution (SAT) using DPLL algorithm.
A python implementation of the DPLL algorithm
The repository for a college AI course
Repositório do projeto da disciplina de Lógica para Computação
In this project, you can see the implementation of the Davis-Putnam (DP) + Davis-Putnam-Logemann-Loveland (DPLL) Algorithms and Resolution to solve SAT problems.
🧩 Solver for N-Puzzle & N-Queens using Genetic Algorithms, A*, and more in Python
This repository has the source code for a fast sudoku solver. This repo is forked from https://github.com/t-dillon/tdoku
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."