Brute force sat solver in OpenCL
-
Updated
Jun 19, 2018 - Java
Brute force sat solver in OpenCL
Simple Java implementation of the Davis–Putnam–Logemann–Loveland (DPLL) algorithm
Experimental Java interpreter written in Java
Command line tool for SAT solving, SMT solving in various theories (NRA, LRA, LIA, EQ, EQUF, BV)
A simple SAT solver written in Java
Implementation of the Davis-Putnam algorithm to solve a simple form of an adventure game. The puzzle includes (1) a maze with treasures at particular nodes; (2) a maximum number of steps; A player gets all the treasures at the node travelled to. The object is to find a path through the maze that collects all the different types of treasure.
EstiMate 🦉: A fast and accurate modelcounter tool for estimating the number of models for LTL formulas using transfer matrices.
A teaching aid for concepts and algorithms in logic
SAT solver using java. Implementing few strategies like elitism, tournament, dynamic crossover andmore.
University algorithm-oriented project that accurately detects complex networks of influential mafia families represented as vertices and edges of rare graphs. The algorithms are being reduced to the Satisfiability Problem using a boolean formula that will be evaluated by an SAT Solver, deciding whether the initial clause has been satisfied or not.
Implementation of n x n SAT Sudoku solver using minisat
Analysis of Formal Specifications SAT, SMT, Alloy, NuSMV.
Determine if a undirected graph can be split into three different sets, under some constraints.
Visual and interactive tool to visualize, learn about, and step through the resolution of SAT CNF formulas
Backtracking SAT (Boolean satisfiability problem) Solver implemented in Java
Add a description, image, and links to the sat-solver topic page so that developers can more easily learn about it.
To associate your repository with the sat-solver topic, visit your repo's landing page and select "manage topics."