An ocaml implementation of conflict-driven reasoning
-
Updated
Jul 13, 2018 - OCaml
An ocaml implementation of conflict-driven reasoning
A sudoku solver web service utilizing SMT/ILP solver Inez
Infer Minimalist Grammars using the Z3 SMT-solver
Yet Another Sat solvER
SEARCH: Symmetric Encryption Algorithm Research
SAT/UNSAT. The course "Boolean satisfiability problems and their applications" by Roman Kholin at CMC MSU. 🍁 Autumn 2021.
Agda library for verifying neural networks.
Solving the VLSI problem using various combinatorial optimization technologies
My attempt at understanding the Z3 API for .NET (F#)
High-level type-safe Rust bindings for the Boolector SMT solver
DSL: automatic derivation of greedy algorithm and dynamic programming
solving-satisfaction-problems-with-theorem-provers
Analysis of Formal Specifications SAT, SMT, Alloy, NuSMV.
Liquid Haskell library for verifying neural networks.
My first SMT solver (only QF_UF)
gradient-based symbolic execution engine implemented from scratch
Add a description, image, and links to the smt-solver topic page so that developers can more easily learn about it.
To associate your repository with the smt-solver topic, visit your repo's landing page and select "manage topics."