There are 2 repositories under satisfiability topic.
Tools for working with circuits as graphs in python
Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability
Kiwi is a minimalist and extendable Constraint Programming (CP) solver.
A simple SAT solver that implements the DPLL algorithm with unit resolution
A customizable timetabling software for educational institutions that encodes timetabling constraints as a SAT formula and solves them using a MaxSAT solver
A library for building efficient set-membership filters and dictionaries based on the Satisfiability problem.
A Free World Class High Performance SAT Solver
[SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline
A simple SAT solver based on the CDCL algorithm
DenseQMC: A bit-slice implementation of the Quine-McCluskey algorithm
Framework for studying cryptographic hash functions using SAT.
A Header-Only CDCL SAT Solver based on MiniSat (Fast and only 500 lines)
A small SAT solver implementation. 2020年度の情報科学特別演習にて書いたプログラム
Encoding different problems into Boolean satisfiability
PicoSAT bindings for R
A python package that recognizes clauses, Cnfs, graphs, hypergraphs, and multi-hypergraphs. The package implements local graph-rewriting, graph-satchecking, calculation of graph disjunctions, as well as checking of new reduction rules.