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

implementing DPLL Algorithm

Python program to convert a Context Free Grammar to Chomsky Normal Form.

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.

A suite for minimizing constraint systems (CNF/DNF/MILP inequalities)

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

Parsing Course Project - A CYK implementation with CNF

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

A system to enable scalable SFCs in Kubernetes

To convert propositional formula onto its equivalent CNF form

Solves problems that are in conjunctive normal form (CNF)

A Python package for learning and solving Boolean satisfiability (SAT) problems using Conjunctive Normal Form (CNF).

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

A Hashiwokakero Solver using PySAT, DPLL, A* and Brute-force with friendly CLI tools for solving and doing benchmark

A Circuit SAT language that emit CNF code.

This repo contains all the solutions to assignments of Discrete Mathematics coursework which can be used as tools

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

Convert SAT CNF files to 3SAT version

Utilizies the harmonic properties of a CNF formula and by using Fourier Series approximations converts it into a mathematical formula.

Optimization & Solving common API (SAT, MILP, etc.)