10 search results - page 1 / 2 » Eliminating Redundant Clauses in SAT Instances |
CPAIOR
2007
Springer
13 years 11 months ago
2007
Springer
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...
SAT
2010
Springer
13 years 8 months ago
2010
Springer
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 ...
TACAS
2010
Springer
13 years 12 months ago
2010
Springer
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...
ICTAI
2008
IEEE
13 years 11 months ago
2008
IEEE
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...
ISMIS
1999
Springer
13 years 9 months ago
1999
Springer
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...