Skip to content
AnnieZhou08Public

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

0 stars

Watchers

0 watching

Forks

Latest commit

 

History

2 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 

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

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors