this program is implemented in C++ and solves simples logic problem using the resolution method

Convert a Context Free Grammar (CFG) to Chomsky Normal Form (CNF)

Populates a CNF formula database and analyze it

University Unification and CNF Converter Project

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). Use a depth first search algorithm for solving the problem. After you assign values to a…

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).

A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem

implementing DPLL Algorithm

When a query is asked, various sentences from Knowledge Base are inferred and outputs whether the given query can be inferred or not based on the Resolution Algorithm

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.

Convert logical problem to CNF

Basic constraint transformation library

Boolean formula to CNF conversion, DPLL and CDCL SAT solving algorithms

A DPLL-based SAT solver focused on traceability

Transformer of propositional logic expressions to CNF and DNF

Parsing Course Project - A CYK implementation with CNF

A simple compiler for parsing java codes and get syntax errors with CYK algorithm for context free grammars (CFG)

BGP VNF based on gobgp