Development and Implementation of a Modular SAT-Solver Framework (Bachelor's Thesis)
Propositional satisfiability is one of many fields in the more general satisfiability testing field. We introduce recent research results concerning the efficiency of solvers and a theoretical approach to propositional satisfiability testing. We combine these two efforts to develop a framework for solving propositional formulas. The framework we developed has two major goals. The first one is to implement an efficient modular solver based on the theoretical model given. The second goal is to use this framework as a teaching tool.