There are 3 repositories under cnf topic.
An advanced SAT solver
4G/5G Mobile Core User Plane
📞📱☎️📡🌐 Cloud Native Telecom Initiative (CNTi) Test Suite is a tool to check for and provide feedback on the use of K8s + cloud native best practices in networking applications and platforms
ARCHIVED: 🧪🛏️Cloud-native Network Function (CNF) Testbed --> See LFN Cloud Native Telecom Initiative https://wiki.lfnetworking.org/pages/viewpage.action?pageId=113213592
An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logtk, a supporting library for manipulating terms, formulas, clauses, etc.
Experimental minisat SAT solver reimplementation in Rust
5G Telco Lab based on OpenShift
Facilitator of attraction and distribution of external traffic within Kubernetes via secondary networks
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
CGen is a tool for encoding SHA-1 and SHA-256 hash functions into CNF in DIMACS format, also into ANF polynominal system in PolyBoRi output format.
Convert a Context Free Grammar (CFG) to Chomsky Normal Form (CNF)
A Free World Class High Performance SAT Solver
A curated list of Telco Cloud ecosystem projects and resources ☁️
DenseQMC: A bit-slice implementation of the Quine-McCluskey algorithm
SAT-solver based on resolution method in 2-CNF using PLY
A simple compiler for parsing java codes and get syntax errors with CYK algorithm for context free grammars (CFG)
Basic constraint transformation library
python cli program to convert latex input to CNF.
SAT'18 Paper: SPUR - Satisfying Perfectly Uniform Random sampler (Winner Best Student Paper)
Problem Solving: A Practical Workbook
SLIME Cloud: A Free Massive World Class High Performance SAT Solver, Winner of Crypto Track and 3rd place on Cloud Track at the SAT Competition 2021.
Windows builds for The Glucose SAT Solver.
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.
# CNF Working Group (WG) is now part of the Cloud Native Telcom Initiative @ https://github.com/lfn-cnti/bestpractices
Source code of paper 'SAT Solving Using XOR-OR-AND Normal Forms'