https://github.com/ben-marshall/sat-solver

A simple combinatorial boolean sat solver based on the AC-3 Algorithm
https://github.com/ben-marshall/sat-solver

ac-3 bison c sat-solver satisfiability satisfiability-solver yacc

Last synced: about 1 year ago
JSON representation

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

• Host: GitHub
• URL: https://github.com/ben-marshall/sat-solver
• Owner: ben-marshall
• Created: 2017-07-09T20:32:49.000Z (almost 9 years ago)
• Default Branch: master
• Last Pushed: 2017-08-05T12:14:15.000Z (almost 9 years ago)
• Last Synced: 2025-02-03T17:49:12.540Z (over 1 year ago)
• Topics: ac-3, bison, c, sat-solver, satisfiability, satisfiability-solver, yacc
• Language: C
• Size: 156 KB
• Stars: 1
• Watchers: 2
• Forks: 1
• Open Issues: 2
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          

# SAT Solver

[![Build Status](https://travis-ci.org/ben-marshall/sat-solver.svg?branch=master)](https://travis-ci.org/ben-marshall/sat-solver)

[![Documentation](https://codedocs.xyz/ben-marshall/sat-solver.svg)](https://codedocs.xyz/ben-marshall/sat-solver/)

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.