In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
Handling redundancy in propositional reasoning and search is an active path of theoretical research. For instance, the complexity of some redundancy-related problems for CNF formu...
In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a hig...