a Pythonic toolkit for working with Boolean expressions

[SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline

The first efficient procedure to test whether a sampler is uniform

Framework for studying cryptographic hash functions using SAT.

High-level interfaces over @msoos's CryptoMiniSat.

Solving the two-dimensional strip packing problem, using several combinatorial decision making and optimization approaches: Constraint Programming, Boolean SATisfiability, Satisfiability Modulo Theory; Integer Linear Programming.

A lightweight CNF SAT constraint encoder library

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.

Optimization & Solving common API (SAT, MILP, etc.)

A naive implementation of Algorithmic Lovász local lemma.

A suite for minimizing constraint systems (CNF/DNF/MILP inequalities)

Using a SAT solver to prove correctness of schedules given a list of constraints.

Artificial Intelligence Lab

This algorithms computes the clauses needed, to solve Minesweeper and check for satisfiability

Pygplib: Python First-Order Graph Property Library

Automated theorem proving, Logic Programming, Optimization examples.

A personal implementation of a basic SAT solver.

An implementation of the DPLL algorithm for solving SAT problems

Certified frame-first SAT middleware — decide structured regions (2-SAT · GF(2) parity · counting) before CDCL, and independently verify every verdict (model replay · DRAT). A research harness for where SAT hardness lives.

A simple implementation of the 3SAT problem