Showing 1-20 of 32 packages
General satisfiability solver for logic problems
Propositional Satisfiability Checker
A Javascript wrapper with a Z3-ish API for SMT-LIB 2.0, the language of Satisfiability Modulo Theories solvers
A module to test satisfiability of Rita rule sets.
Boolean formula satisfiability algorithms for JavaScript
This library provides tools for solving Boolean satisfiability problems (SAT). It includes functions for generating all solutions to a given problem and for finding a single solution using the DPLL algorithm.
A Javascript wrapper with a Z3-ish API for SMT-LIB 2.6, the language of Satisfiability Modulo Theories solvers
2-Satisfiability code bricks for JavaScript
type signature satisfiability solver under function composition
boolector Satisfiability Modulo Theories (SMT) solver
Predict the output of Math.random
Scope checking utilities for Taskcluster
Implementation of Espresso-II method for heuristic minimization of single output boolean functions
Propositional proof system
MCP server providing Z3 SMT solver capabilities
2SAT solver
Solves HORNSAT
Schemas for JSON Objects, or simply SJOT, offers faster JSON validation and type checking with lightweight schemas and compact validators. SJOT schemas have the look and feel of object templates and are easy to use.
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).
A simple doplo solver