Touching upon Search, Propositional Logic, RL, NLP
-
Updated
Apr 27, 2019 - Python
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#.
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
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
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)
Naïve SAT solver implementing the classic DPLL algorithm
This program checks if an input CNF is satisfiable or not to check logical entailment.
The repository for a college AI course
Repositório do projeto da disciplina de Lógica para Computação
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."