A lightweight package for evaluating formulas of Boolean logic
-
Updated
Jul 21, 2020 - JavaScript
A lightweight package for evaluating formulas of Boolean logic
Verifies SAT solver output. Uses drat-trim proof checker for UNSAT instances.
První projekt z předmětu IZLO.
[SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline
A SAT solver for propositional clauses in cnf form
Optimized 32-Bit Full Adder, CEC-SAT Verifier & 2-SAT Solver
Yet Another Sat solvER
A SAT-based forward/backwards solver for Conway's "Game of Life".
SudokuAreEz-SAT are project implement Mathematics Logic using Boolean Satisfiability to solve Sudoku puzzle.
Model the card game Yaniv in predicate logic. Project for Queen's University course CISC/CMPE 204: Logic for Computing Science.
Pygplib: Python First-Order Graph Property Library
CDCL SAT Solver implementation for babies
Using a SAT solver to prove correctness of schedules given a list of constraints.
Code and text for the suspended paper/project "Predicting Satisfiability of Benchmark Instances".
OCaml experimental sat3 solver
Proof of concept approach to Differentiable Answer Set Programming and Differentiable Satisfiability, for sampling and multimodels optimization. For Clingo (https://potassco.org/) + Python
Solving the N-Queens Problem Using a SAT Solver
A DPLL-based SAT solver focused on traceability
Add a description, image, and links to the satisfiability topic page so that developers can more easily learn about it.
To associate your repository with the satisfiability topic, visit your repo's landing page and select "manage topics."