dpll

An advanced SAT solver

A simple SAT solver that implements the DPLL algorithm with unit resolution

华中科技大学数据结构课程设计2018 An algorithm to solve SAT problem

Program Design affiliated to General Course Design of CSE College, HUST, for students enrolled in 2018.

A small SAT solver implementation. 2020年度の情報科学特別演習にて書いたプログラム

A simple theorem prover made for a university programming assignment

CS156 - Fall 2014 - Introduction to Artificial Intelligence

DPLL boolean satisfiability solver for .NET

Simple Java implementation of the Davis–Putnam–Logemann–Loveland (DPLL) algorithm

Python Implemetation of DPLL algorithm to solve Boolean Satisfiability problem

A sudoku solver, using SAT

华中科技大学数据结构课程设计2018 the optimizetion of DPLL

Implement a SAT solver to find a satisfying assignment for any given CNF sentences, You are also asked to implement the WalkSAT algorithm ( AIMA Figure 7.18 ) to search for a solution for an instance of wedding. Suppose you have a wedding to plan, and want to arrange the wedding seating for a certain number of guests in a hall. The hall has a certain number of tables for seating. Some pairs of guests are couples or close Friends (F) and want to sit together at the same table. Some other pairs of guests are Enemies (E) and must be separated into different tables. The rest of the pairs are Indifferent (I) to each other and do not mind sitting together or not. However, each pair of guests can have only one relationship, (F), (E) or (I). You must find a seating arrangement that satisfies all the constraints.

My first SMT solver (only QF_UF)

华中科技大学计算机科学与技术学院程序设计

Optimized 32-Bit Full Adder, CEC-SAT Verifier & 2-SAT Solver

Yet Another SAT solver

Simple implementation and parallelization of the DPLL algorithm for the satisfiability problem.

This program checks if an input CNF is satisfiable or not to check logical entailment.

Touching upon Search, Propositional Logic, RL, NLP

DPP and DPLL algorithms

ECE 653 - testing, Quality Assurance, and Maintenance.This repo holds all material, notes and assignments related to the mentioned course.

Implementation of the DPLL algorithm for solving the satisfiability problem of propositional logic

SAT and SMT solving.

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.cs.us.es/~fsancho/?e=120. The tests have been implemented based on the examples that appear in a link to netlogo on that page. If you have an expedition in FBC (with connectors => and <=>) you can switch to an FNC, which would be the entrance to this project, downloading the https://github.com/bertuccio/inferencia-logica-proposicional project. This project can be completed with the DPLL algorithm by adding the instructions given from the definition of the DPLL function to the end. And activating the instructions that appear in the function pasa-lista-FBF-to-lista-FNC that would serve as an interface between both projects. In fact, DPLL_propositional_logical_inference is intended to complete Propositional Logical Inference, with the DPLL algorithm and share functions. Requirements: Allegro CL 10.1 Free Express Edition References: https://github.com/bertuccio/inferencia-logica-proposicional by Adrián Lorenzo Mateo (Bertuccio) who uses material from the Artificial Intelligence practices at the Higher Polytechnic School of the Autonomous University of Madrid. Informatics Engineering. http://www.cs.us.es/~fsancho/?e=120 by Fernando Sancho Caparrini. Higher Technical School of Computer Engineering of the University of Seville.

ECE 208 Bonus Assignment

A (parallel) implementation of the classic DPLL algorithm using Cilk

A python implementation of the DPLL algorithm