Boolean satisfiability

Abstract

I have tried to implement an SAT solver using the Davis–Putnam–Logemann– Loveland (DPLL) algorithm. The DPLL algorithm consists of three stages, Unit Propagation, Pure literal Elimination and backtracking by choosing a literal which occurs most frequently in all the clauses combined. I used ReactJS to make the user Interface for inputting the clauses and the internal code takes the input and performs the unit propagation, pure literal Elimination and backtracking and provides the output stating whether the given Boolean formula in conjunctive normal form is satisfiable (there exists a result of true for various combination of Boolean values) or unsatisfiable (when various combination of Boolean values of the given literal fails to provide a true value as a result)