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.
Modeling Sudoku problem using propositional logic and employing DPLL algorithm to solve it
😆 2-Satisfiability library for JavaScript
Investigate phase transitions in k-SAT problems
Add a description, image, and links to the 2-sat topic page so that developers can more easily learn about it.
To associate your repository with the 2-sat topic, visit your repo's landing page and select "manage topics."