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

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

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

High-level interfaces over @msoos's CryptoMiniSat.

python cli program to convert latex input to CNF.

A system to enable scalable SFCs in Kubernetes

implementing DPLL Algorithm

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.

A Python package for working with Conjunctive Normal Form (CNFs) and Boolean Satisfiability (SAT)

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

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

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

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

A comprehensive Python framework for parsing, transforming, and benchmarking CNF files for SAT solving research.

STTF

This project is done by CNF algorithms

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

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