Check to see if a mapping exists between 2 graphs (subgraph-isomorphism) by developing optimised SAT clauses and solving them using MINISAT.
-
Updated
Nov 27, 2016 - C++
Check to see if a mapping exists between 2 graphs (subgraph-isomorphism) by developing optimised SAT clauses and solving them using MINISAT.
A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem
A simple combinatorial boolean sat solver based on the AC-3 Algorithm
A SAT solver for propositional clauses in cnf form
SAT implementation of stable matching problem with couples and reference implementations of deferred acceptance algorithms.
A DPLL-based SAT solver focused on traceability
Design challenge for the 50.002 module for the fastest 2-SAT solver and the best performance-area ratio for a 32-bit adder.
Kiwi is a minimalist and extendable Constraint Programming (CP) solver.
A simple SAT solver written in Java
A simple SAT solver that implements the DPLL algorithm with unit resolution
A simple SAT solver based on the CDCL algorithm
A customizable timetabling software for educational institutions that encodes timetabling constraints as a SAT formula and solves them using a MaxSAT solver
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."