A 2-SAT solver that determines satisfiability by constructing an implication graph and using Tarjan's Algorithm to find strongly connected components (SCCs), implemented in C++.
-
Updated
Mar 2, 2025 - C++
#
2sat
Here are 5 public repositories matching this topic...
This project was designed to serve as a research-grade symbolic reasoning dashboard that helps others explore the bridge between computational logic and interactive visualization.
python matrix python3 z3 cnf sat-solver smt sat collatz-conjecture 3sat horn-clauses z3-smt-solver cnf-clauses tseitin-transformation wsl-ubuntu 2sat goldbach-conjecture collatz-conjecture-visualizer
-
Updated
Nov 21, 2025 - Python
2-sat linear time solver implementing the Aspvall, Plass and Tarjan algorithm in Haskell.
-
Updated
Oct 16, 2023 - Haskell
highly efficient 2SAT solution using only discovery array
-
Updated
Oct 1, 2020 - Python
Improve this page
Add a description, image, and links to the 2sat topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the 2sat topic, visit your repo's landing page and select "manage topics."