Bosphorus, ANF simplifier and solver, and ANF-to-CNF converter

TouIST, the IDE & Language for Logic (backed by SAT, SMT and QBF solvers)

Graph grounding for graph coloring algorithms such as Welsh Powell and Evolution algorithms like Harmony Search and Genetic

Implementation of branch and bound algorithm for maximum clique problem

CGen is a tool for encoding SHA-1 and SHA-256 hash functions into CNF in DIMACS format, also into ANF polynominal system in PolyBoRi output format.

Genetic Algorithm for the Maximum Clique Problem

Manipulate NNF (Negation Normal Form) logical sentences

a collection of benchmarks (in DIMACS format) for various NP-Complete problems

LibMVC is a collection of fast iterative minimum vertex cover solvers. Currently NuMVC and FastVC are implemented.

CMSGen, a fast weighted uniform-like sampler

A diabolic implementation of mcSAT 😈

Results of popular Steiner tree instances

Utilities to parse files in DIMACS format which is the de-facto standard for input to SAT solvers.

Coverts a generic Verilog netlist into the DIMACS format compatible with many SAT solvers

A simple theorem prover made for a university programming assignment

A knowledge compiler for wDNNF, pwDNNF, nwDNNF and (s)d-DNNF circuits

Windows builds for The Glucose SAT Solver.

Compile MiniSat to WebAssembly using emscripten

A generator of graphs written in Python and LaTeX

Compile microsat to WebAssembly using emscripten

An implementation of a recursive DPLL solver in OCaml. It parses setup (cnf ) DIMACS and checks if the formula is satisfied.

Compile SPUR to WebAssembly using emscripten

A generic SAT solver designed to solve SAT problems in the DIMACS format.

Model Counting Competition Submission of Ganak + Approxmc 2025

A set of parsers for DIMACS formats written in Prolog

No description provided.

C++ MaxClique for Operations Research course

Dijkstra Single Source Shortest Path using Boost

Repository for the Graph Algorithms course laboratories at AGH University of Krakow. This repository contains implementations of various graph algorithms covered during the course. Each lab includes problem descriptions, code implementations, and example test cases.

A program which will read a sudoku puzzle from a file (some examples are sudoku1.txt, sudoku2.txt, etc) and generate clauses in the DIMACS format for each sudoku puzzle in the files sudokuN.cnf, where N = 1, 2, ..., 5.