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

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

Parsing Course Project - A CYK implementation with CNF

To convert propositional formula onto its equivalent CNF form

SAT Solving in Python

Almost Perfectly Non-linear (APN) S-box problem generator

SAT-solver based on resolution method in 2-CNF using PLY

A program which will read a sudoku puzzle from a file (some examples are sudoku1.txt, sudoku2.txt, etc) and generate clauses in the DIMACS format for each sudoku puzzle in the files sudokuN.cnf, where N = 1, 2, ..., 5.

Designed a self-service automated system to alert patients/customers about potential drug interactions for both prescription and over the counter drugs.

Repositório do projeto da disciplina de Lógica para Computação

eNFA - NFA, DFA - DFA minimization, CNF and CKY

Convert Normal Form to CNF & DNF using regex in Python

Programa en Python para pasar expresiones de lógica en notación polaca a un fichero para ser procesado por la herramienta Clingo.

A Circuit SAT language that emit CNF code.

This project is done by CNF algorithms

Simple SAT solver implementation using python. It also includes a BNF to CNF converter

Tugas ini merupakan salah satu tugas besar matakuliah IF2124 Teori Bahasa Formal dan Automata yang berfokus pada pengaplikasian Context Free Grammar (CFG), Chomsky Normal Form (CNF), dan Algoritma CYK (Cocke-Younger-Yagami) untuk melakukan parsing terhadap bahasa pemrograman JavaScript.

CNF Solver using Evolutionary Algorithm and Parameters search.

Convert SAT CNF files to 3SAT version