-
Updated
Jul 21, 2022 - Java
#
sat-solving
Here are 60 public repositories matching this topic...
Source code of paper 'SAT Solving Using XOR-OR-AND Normal Forms'
-
Updated
Apr 18, 2025
An open, checkable map of AI-assisted discovery in mathematics, named in honor of Paul Erdős's problems. Every result of ours carries receipts: two independent checks, a control and a rerunnable certificate.
mathematics knowledge-graph combinatorics oeis reproducibility formal-verification sat-solving lean4 erdos-problems ai-assisted-discovery
-
Updated
Nov 13, 2026 - Python
Поиск входных переменных в булевой формуле
-
Updated
Jun 14, 2025 - Python
Windows builds for The Glucose SAT Solver.
-
Updated
Aug 19, 2021 - C++
Python tool for converting ANF to (2-)XNF.
-
Updated
Oct 29, 2026 - Python
Immediate Massively Parallel Propositional Proof Checking
-
Updated
Apr 29, 2026 - C
STTF
open-source benchmarking trace-format formal-methods cnf preprocessing reproducibility deterministic sat sat-solving open-source-standard
-
Updated
Nov 30, 2025 - Python
A search program that uses SAT solvers to find patterns in Higher Range Outer Totalistic (HROT) rules
-
Updated
Nov 8, 2023 - Python
Finite formal argumentation frameworks and semantics: Dung, ASPIC+, bipolar, partial, and revision
argumentation knowledge-representation probabilistic-argumentation abstract-argumentation dung sat-solving aspic nonmonotonic-reasoning formal-argumentation bipolar-argumentation iccma
-
Updated
Nov 1, 2026 - Python
Distributed proof-of-work and problem solving via Steam Workshop/API and other gaming platform networks
open-source steam distributed-systems lua simulation game-development distributed-computing nickel boinc volunteer-computing proof-of-work game-modding deterministic-simulation sat-solving hyperpolymath epistemic-infrastructure epistemic-computing veridical-computing equivalence-aware-computing typed-provenance
-
Updated
Nov 11, 2026 - Nickel
Looking for solutions of certain sizes with Glucose, Kissat and CaDiCaL
-
Updated
Feb 11, 2026 - Python
This repository provides a reproducible benchmark exploring how **ethical coherence fields (Harmony, Balance, Creativity, Connectedness, Respect)** — originally introduced in the **Maat Field Theory of Everything (MFToE)** — correlate with computational hardness in **random 3-SAT** instances.
benchmark reproducible-research scientific-computing graph-theory complexity-theory ai-research sat-solving
-
Updated
Oct 24, 2025 - Python
Solving the Yashi game using a combination of graph theory and SAT-solving. First, connectivity of the graph is verified, and if true, identification of all possible cycles is done. Then, after generating all necessary constraints, they are passed to a SAT solver.
-
Updated
Sep 29, 2023 - Python
SAT-Web is a web-based educational tool for explaining SAT solving. It provides visualisations with search trees and variable interaction graphs, and includes a DPLL solver with tracing.
-
Updated
Aug 31, 2026 - Svelte
My first SMT solver (only QF_UF)
satisfiability-modulo-theories logic-programming cnf learning-by-doing sat-solver smt-solver dpll tseitin-transformation cdcl logical-reasoning congruence-closure backjumping cdcl-t sat-solving qf-uf diy-smt
-
Updated
Jul 8, 2020 - Haskell
Machine-checked soundness proof in Lean 4 for the RUP and RAT rules that DRAT proof checkers apply
-
Updated
Nov 7, 2026 - Lean
-
Updated
Nov 13, 2019 - C++
A natural deduction theorem prover using SAT solvers
-
Updated
May 17, 2026 - Rust
Add this topic to your repo
To associate your repository with the sat-solving topic, visit your repo's landing page and select "manage topics."