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

SAT-X is a language for constrained optimization and decision problems over positive integers, that work with any SAT Competition standard SAT solver. Is based on Python, and is ase to learn and easy to use with all technologies associated to this language.

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)

Parsing toys

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

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

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

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

STTF

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

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