Skip to content

A satisfiability solver written in Racket that determines whether a logical statement is provable when entered in conjunctive normal form using DFS algorithm

Notifications You must be signed in to change notification settings

AnnieZhou08/SATsolver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

SATsolver

About

A satisfiability solver written in Racket that determines whether a logical statement is provable when entered in conjunctive normal form using DFS algorithm

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published