Transformer of propositional logic expressions to CNF and DNF
-
Updated
May 1, 2018 - Haskell
Transformer of propositional logic expressions to CNF and DNF
CNF Generator for Factoring Problems
My first SMT solver (only QF_UF)
Haskell Implementation of DPLL + Sudoku with SAT
Tool for converting context-free grammars (CFG) to Chomsky Normal Form (CNF)
Add a description, image, and links to the cnf topic page so that developers can more easily learn about it.
To associate your repository with the cnf topic, visit your repo's landing page and select "manage topics."