Actin - Technical Report

Abstract. The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis dependent dynamic decision heuristics has proved to be particularly efficient, e.g. in Chaff. In this work, algorithms that initialize the variable activity values in the solver Min

• Type: Journal
• Year: 2007
• Where: CORR
• Authors: Raihan H. Kibria
• Keywords: Boolean Satisfiability Problem, CORR 2007, Dynamic Decision, Education, Industrial Sat Problems