SAT-solver based on resolution method in 2-CNF using PLY
-
Updated
Jan 31, 2020 - Python
#
2-sat
Here are 5 public repositories matching this topic...
Yeah, nah, don't look into alternative_sat
-
Updated
Dec 23, 2022 - Python
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.
-
Updated
Mar 10, 2023 - Python
😆 2-Satisfiability library for JavaScript
-
Updated
Dec 15, 2023 - JavaScript
Modeling Sudoku problem using propositional logic and employing DPLL algorithm to solve it
-
Updated
Oct 30, 2023 - C++
Improve this page
Add a description, image, and links to the 2-sat topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the 2-sat topic, visit your repo's landing page and select "manage topics."