cnf
Here are 123 public repositories matching this topic...
This program checks if an input CNF is satisfiable or not to check logical entailment.
-
Updated
Nov 19, 2020 - Jupyter Notebook
Source code of paper 'SAT Solving Using XOR-OR-AND Normal Forms'
-
Updated
Nov 6, 2023
To convert propositional formula onto its equivalent CNF form
-
Updated
Sep 14, 2018 - Python
Automatically checks whether a given propositional formula is satisfiable.
-
Updated
Nov 22, 2019 - Java
CNF Solver using Evolutionary Algorithm and Parameters search.
-
Updated
Jan 23, 2023 - Python
Almost Perfectly Non-linear (APN) S-box problem generator
-
Updated
May 13, 2019 - Python
Tool for converting context-free grammars (CFG) to Chomsky Normal Form (CNF)
-
Updated
Mar 14, 2022 - Haskell
The CNF-SAT problem is: Given a logical expression in Conjunctive Normal Form, is there a truth assignment for the variables which causes the CNF expression to be true? Answer is yes, if there is an assignment that makes all the clauses evaluate to T (true).
-
Updated
Feb 12, 2017 - C
[Uc3m] Welcome to the Open Secure Sockets Layer
-
Updated
Dec 4, 2022
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.
-
Updated
Feb 14, 2018 - Prolog
Improve this page
Add a description, image, and links to the cnf topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the cnf topic, visit your repo's landing page and select "manage topics."