Skip to content

A simple combinatorial boolean sat solver based on the AC-3 Algorithm

Notifications You must be signed in to change notification settings

ben-marshall/sat-solver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

SAT Solver

Build Status Documentation

A simple SAT Solver based on the AC-3 Algorithm


This is a simple SAT solver based on the AC-3 Algorithm. It takes sets of boolean expressions over a set of one or more variables, and computes whether the expression(s) are satisfiable, that is: can be evaluated as true for some set of inputs.

The aim is to use this as a testbed for experimenting with SAT Solvers, looking at how they can be optimised for space/time complexity, and eventually implemented in hardware.