:milky_way: Supplementary materials for Discrete Math course at ITMO University

Brenda is a boolean expression solver for Go AST

A Lazy Clause Generation solver with a focus on modularity and maintainability in addition to speed

A fast and certifying solver for quantified Boolean formulas.

Different heuristics and random initialization methods applied to GSAT and WalkSAT algorithms

A solution to the Boolean Blindness problem.

CDCL SAT Solver from Scratch in Python

MiniZinc ↔ .NET

SLIME Cloud: A Free Massive World Class High Performance SAT Solver, Winner of Crypto Track and 3rd place on Cloud Track at the SAT Competition 2021.

A Reduced-order Binary Decision Diagram (RoBDD) SAT solver written in Rust

Boolean SAT solver based on DPLL algorithm with randomization and geometric restarts (RGR) heuristic

Rust powered engine for solving Boolean satisfiability problems

Generate and solve random instances of MAX-SAT and instances of MAX-SAT that are deterministically and pseudo-randomly generated from the solutions of previous MAX-SAT instances. This is a prototype of how a proof of work algorithm can be derived from a relevant problem.

💣 Minesweeper solver implemented using pysat and visualized using pygame. Also a version of Minesweeper with no guessing needed!

Python tool for converting ANF to (2-)XNF.

OCaml experimental sat3 solver

python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time

Universal dependency resolver using SAT solvers - works for software packages, course prerequisites, books, certifications, and any system with logical dependencies

Advanced Algorithms | Spring 2021 | DPLL SAT solver for Sudoku

The boolean satisfaction and optimization library for .NET

Super efficient SAT solver in 500 lines of code

SAT hardness atlas mapping runtime landscapes and phase transition structure of random SAT instances.

AI4Verification，Verfication，EDA，AI4EDA，SAT

Slitherlink Puzzle interpreting as a SAT Problem

Using Javascript to configure the new approach to how to handle and sort large dataset known as SAT often referred to as Boolean satisfiability in a timeframe using predetermined results to speed things up.

CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem

CDCL based SAT Solver for boolean formulas in DIMACS CNF format

Verified training data for frontier AI. Every sample passes a SAT gate. Built on satisfaction-suffices.

Default-closed SAT verification gate for AI outputs. Structural containment via Boolean satisfiability.

A high-performance C++17 benchmarking suite comparing classical SAT solving algorithms (CDCL, DPLL, Davis-Putnam, Resolution). Includes a custom DIMACS CNF generator in Python and comprehensive performance metrics for 2SAT and 3SAT instances.