z3-solver
This project provides high-level and low-level TypeScript bindings for the [Z3 theorem prover](https://github.com/Z3Prover/z3). It is available on npm as [z3-solver](https://www.npmjs.com/package/z3-solver).
Found 12 results for satisfiability modulo theories
boolean-logic
A lightweight package for evaluating formulas of Boolean logic
2-sat
2SAT solver
dtk-z3-solver-deno-v2
This directory contains JavaScript code to automatically derive TypeScript bindings for the C API, which are published on npm as [z3-solver](https://www.npmjs.com/package/z3-solver).
horn-sat
Solves HORNSAT
plpgen
Propositional Logic Problem Generator
naive-3-sat
naive solver for the 3-sat problem
@aureooms/js-2sat
2-Satisfiability code bricks for JavaScript
propsat
Propositional Satisfiability Checker
@problem-solving/sat
Boolean formula satisfiability algorithms for JavaScript
crackle
JavaScript predicate, comparator, equality, and utility functions
@recubed/object-satisfies
key-based object validation