dpll
There are 0 repository under dpll topic.
msoos / cryptominisat
An advanced SAT solver
Language:C++ 798sukrutrao / SAT-Solver-DPLL
A simple SAT solver that implements the DPLL algorithm with unit resolution
Language:C++ 43- Gymbo
Koukyosyumei / Gymbo
gradient-based symbolic execution engine implemented from scratch
Language:C++ 35 Billy1900 / DPLL-Algorithm
华中科技大学数据结构课程设计2018 An algorithm to solve SAT problem
Language:C++ 31NickLee2050 / HustProgramDesign
Program Design affiliated to General Course Design of CSE College, HUST, for students enrolled in 2018.
Language:C 14- Language:Python 9
nano-byte / sat-solver
DPLL boolean satisfiability solver for .NET
Language:C# 9private-yusuke / sat-d
A small SAT solver implementation. 2020年度の情報科学特別演習にて書いたプログラム
Language:D 9safwankdb / SAT-Solver-using-DPLL
Python Implemetation of DPLL algorithm to solve Boolean Satisfiability problem
Language:Python 6j-christl / DpllSatSolver
Simple Java implementation of the Davis–Putnam–Logemann–Loveland (DPLL) algorithm
Language:Java 5georgejkaye / theorem-prover
A simple theorem prover made for a university programming assignment
Language:Java 4paultristanwagner / satisfiability-checking
Command line tool for SAT solving, SMT solving in various theories (NRA, LRA, LIA, EQ, EQUF, BV)
Language:Java 4- Language:Python 4
- Language:C++ 3
prashanthmulge / SAT-Encoding-Solver
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.
Language:Python 2sai-teja-ponugoti / Software-Testing-Quality-Assurance-and-Maintenance
ECE 653 - testing, Quality Assurance, and Maintenance.This repo holds all material, notes and assignments related to the mentioned course.
- Language:Haskell 2
AnsgarKlein / DPLL-SAT-Solver
Implementation of the DPLL algorithm for solving the satisfiability problem of propositional logic
Language:C 1- Language:Haskell 1
jamestiotio / DigiAlpha
Optimized 32-Bit Full Adder, CEC-SAT Verifier & 2-SAT Solver
Language:C++ 1os12345678 / SAT_DPLL
An implementation of the DPLL algorithm for solving SAT problems
Language:Python 1Popa611 / SAT-solver
Simple implementation and parallelization of the DPLL algorithm for the satisfiability problem.
Language:C# 1ablanco1950 / DPLL_propositional_logical_inference
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.
Language:Common Lisp 0armanhbi / DPLLAlgorithm
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 like this of course! So have fun!
Language:Python 0- Language:Java 0
dakotawong / Native-Sat-Solver-Package
SAT Solver NPM Package written in C++
Language:C++ 0j-danner / 2xnf_solver
Graph-based DPLL-SAT Solver for propositional logic formulas in XOR-OR-AND normal form (XNF).
Language:C++ 0joshuaguerin / DPLL
A simple DPLL implementation written in Haskell.
Language:Haskell 0- Language:Python 0
- Language:Zig 0
- Language:Jupyter Notebook 0
StenLeinasaar / 3SAT-and-KnapSacks
Final project for Computability and Complexity course
Language:Python 0- Language:C++ 0
karipov / sat-solver
Iterative DPLL SAT Solver with occurrence lists, jeroslow-wang heuristic
Language:Julia
