Compile SPUR to WebAssembly using emscripten
-
Updated
Feb 5, 2020 - C++
Compile SPUR to WebAssembly using emscripten
This program checks if an input CNF is satisfiable or not to check logical entailment.
CNF Certification is now part of the Cloud Native Telcom Initiative's test catalog focus area @ https://github.com/lfn-cnti/certification
The CFL Reachability problem involves determining whether there is a path in a graph where the concatenation of edge labels along the path forms a string that belongs to a given context-free language.
Source code of paper 'SAT Solving Using XOR-OR-AND Normal Forms'
To convert propositional formula onto its equivalent CNF form
GW Tester demo initial version
Almost Perfectly Non-linear (APN) S-box problem generator
Tool for converting context-free grammars (CFG) to Chomsky Normal Form (CNF)
Windows builds for The Glucose SAT Solver.
CNF Solver using Evolutionary Algorithm and Parameters search.
A small CNF-SAT solver implementing simple conflict driven clause learning (CDCL) and a simple branching heuristic.
Converting formula into CNF using rules. Created at the University as the project within Logic in Computer Science classes in 2016. The purpose of this project was to learn converting formulas into CNF based on Prolog's rules.
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."