SAT-solver based on resolution method in 2-CNF using PLY
-
Updated
Jan 31, 2020 - Python
SAT-solver based on resolution method in 2-CNF using PLY
Yeah, nah, don't look into alternative_sat
This is an algorithm that given a Boolean formula with n=3 distinct variables and 2 variables per clause (2-Satisfiability), determines the values of the variables that result in the formula being TRUE, or determines that there is no solution and the formula is never TRUE. Written in Python.
Modern, header-only ISO C++20 library for finite discrete mathematics and algorithmic structures. Unified bridge architecture across graphs, automata, logic, order theory, and abstract algebra with zero external dependencies.
😆 2-Satisfiability library for JavaScript
Modeling Sudoku problem using propositional logic and employing DPLL algorithm to solve it
Investigate phase transitions in k-SAT problems
Sharp median-graph realizations by maximum-independent-set token sliding in König-Egerváry graphs
Tarjan’s algorithm
MATLAB implementations and reports for the Randomized Algorithms course at the Technical University of Crete (2024–25): coupon collector, balls & bins, Hamiltonian cycles, Max-Cut, Johnson-Lindenstrauss and randomized 2-SAT.
To associate your repository with the 2-sat topic, visit your repo's landing page and select "manage topics."