GitHub - ThoAppelsin/CNF-SAT-Solver: A decider checking whether a given formula in conjunctive normal form is satisfiable.

ThoAppelsin / CNF-SAT-Solver Public

A decider checking whether a given formula in conjunctive normal form is satisfiable.

Name		Name	Last commit message	Last commit date
Latest commit History 29 Commits
.vscode		.vscode
SATproblem		SATproblem
Verifier		Verifier
report		report
submission		submission
.gitignore		.gitignore
desc.pdf		desc.pdf
dump.sol		dump.sol
gmon.out		gmon.out
hw3_probs.zip		hw3_probs.zip
s3		s3
s3.exe		s3.exe
satsolver.c		satsolver.c
satsolver.exe		satsolver.exe
satsolver2.c		satsolver2.c
satsolver3.c		satsolver3.c
utkan_gezer_hw3_sat_solver.zip		utkan_gezer_hw3_sat_solver.zip

Provide feedback