Command line tool for SAT solving, SMT solving in various theories (NRA, LRA, LIA, EQ, EQUF, BV)
-
Updated
Jul 15, 2024 - Java
Command line tool for SAT solving, SMT solving in various theories (NRA, LRA, LIA, EQ, EQUF, BV)
Analysis of Formal Specifications SAT, SMT, Alloy, NuSMV.
A teaching aid for concepts and algorithms in logic
EstiMate 🦉: A fast and accurate modelcounter tool for estimating the number of models for LTL formulas using transfer matrices.
My Graduate Thesis 2024 - University of Engineering and Technology
Projet de Détermination de Satisfaisabilité SAT via Graphes et Composantes Fortement Connexes
A recursive algorithm with backtracking in Java to solve the NP problem of SAT solving.
Visual and interactive tool to visualize, learn about, and step through the resolution of SAT CNF formulas
Experimental Java interpreter written in Java
A SAT solver using DPLL algorithm.
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.
This project provides a UI to test different searching algorithms and metaheuristics on different SAT benchmarks and compare them
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.
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."