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.
-
Updated
Mar 10, 2017 - Python
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.
🌳 Implementation of tree search algorithms dealing with satisfiability of propositional logic sentences
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.
This repository for implementations of Artificial intelligence algorithms
Parallel SAT Solver
Simple Java implementation of the Davis–Putnam–Logemann–Loveland (DPLL) algorithm
DPP and DPLL algorithms
Boolean formula to CNF conversion, DPLL and CDCL SAT solving algorithms
A DPLL-based SAT solver focused on traceability
Simple Python implementation of a Complete/Systematic SAT Solver with the DPLL algorithm
The repository for a college AI course
A python implementation of the DPLL algorithm
Boolean satisfiability problem (SAT), maximum satisfiability problem (MAX-SAT) etc
Touching upon Search, Propositional Logic, RL, NLP
A simple SAT solver in python based on DPLL alrorithm. https://en.wikipedia.org/wiki/DPLL_algorithm
华中科技大学数据结构课程设计2018 An algorithm to solve SAT problem
A simple SAT solver that implements the DPLL algorithm with unit resolution
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."