Visual and interactive tool to visualize, learn about, and step through the resolution of SAT CNF formulas
-
Updated
Sep 14, 2023 - Java
Visual and interactive tool to visualize, learn about, and step through the resolution of SAT CNF formulas
This project provides a UI to test different searching algorithms and metaheuristics on different SAT benchmarks and compare them
Testing two approaches for enumerating the most important combinations of Interpretations in a SAT formulae solutions..
A SAT Solver Using Search Algorithms (DFS, BFS and A*) and Metaheuristic (genetic algorithm and PSO) in JAVA
Compares an algorithm that solves the K-Clique problem exponentially with an algorithm that solves the polynomial transformation to SAT
A view of a stochastic algorithm on the satisfiability problem, when increasing the number of conjunctions and statements
Low-level Java bindings to the IPASIR C interface
This project aims at creating a realtime physics engine to be used in games
SAT solver using java. Implementing few strategies like elitism, tournament, dynamic crossover andmore.
A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem
Students Project at LUH Hannover, Germany
Sudoku Solver by constraint satisfaction problem (CSP) using heuristics - Minimum Remaining Value (MRV), Least Common Value (LCV), Maintainin Arc Consistency (MAC). Secondly, by converting to Satisfiability Problem (SAT) and using a sat solver (miniSAT).
A bunch of useful scripts at some points in my academic walkthrough..
Add a description, image, and links to the sat topic page so that developers can more easily learn about it.
To associate your repository with the sat topic, visit your repo's landing page and select "manage topics."