GitHub repository: schadal1/DFS_CNF_SAT_Problem
Created: 2017-02-12T05:30:14Z
Description: The CNF-SAT problem is: Given a logical expression in Conjunctive Normal Form, is there a truth assignment for the variables which causes the CNF expression to be true? Answer is yes, if there is an assignment that makes all the clauses evaluate to T (true).