260 search results - page 1 / 52 » Blocked Clause Elimination |
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 11 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...
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
ACSD
2007
IEEE
13 years 6 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
CADE
2006
Springer
14 years 4 months ago
2006
Springer
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order probl...