Skip to content

Propositional logic SAT solver using the DPLL method. Supported by a lexer, parser, and clause form converter.

Notifications You must be signed in to change notification settings

benmandrew/saguaro

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

18 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Saguaro

header

Compilation and Usage

dune build
./_build/default/source/saguaro.exe FILE

FILE contains the propositional formula you wish to solve.

Syntax

~   negation
&   and
|   or
=>  implication
<=> iff

Precedence decreases downwards. Brackets can be used for explicit precedence. Variables must be a string of alphabetical ASCII characters.

Example formulae

  • A <=> ~A
  • A & C => A | B
  • A & B & C & D | E

About

Propositional logic SAT solver using the DPLL method. Supported by a lexer, parser, and clause form converter.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published