Implementation of n x n SAT Sudoku solver using minisat
-
Updated
Apr 2, 2021 - Java
Implementation of n x n SAT Sudoku solver using minisat
Export conclusions with resolution (resolution) / conclusions with forward chaining for (definite) Horn clauses of propositional logic
Automatically checks whether a given propositional formula is satisfiable.
Visual and interactive tool to visualize, learn about, and step through the resolution of SAT CNF formulas
Add a description, image, and links to the cnf-clauses topic page so that developers can more easily learn about it.
To associate your repository with the cnf-clauses topic, visit your repo's landing page and select "manage topics."