Analysis of Formal Specifications SAT, SMT, Alloy, NuSMV.
-
Updated
Jun 25, 2024 - Java
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
A SAT Solver Using Search Algorithms (DFS, BFS and A*) and Metaheuristic (genetic algorithm and PSO) in JAVA
Reduced NP-Hard problems such as K-Colorability, K-clique, Maximum clique to SAT problem
Reduced NP‑Hard problems such as K‑Colorability, K‑clique, Maximum clique to SAT problem using Weighted Partial Max‑SAT Input format,created using boolean formulas, in order to find a satisfying interpretation. Families are represented as vertices of a graph.
A recursive algorithm with backtracking in Java to solve the NP problem of SAT solving.
Java & Python Implementation of the Boolean Satisfiability Problem Solver
My Graduate Thesis 2024 - University of Engineering and Technology
A SAT solver using DPLL algorithm.
A better sat-solver than my previous String-based sat-solver
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."