Name
Abstract | ||
|---|---|---|
In the last few years, we have seen a tremendous boost in the efficiency of SAT solvers, this boost being mostly due to CHAFF. CHAFF owes some of its efficiency to its "two-literal watching" data structure. In this paper we present watched data structures for Quantified Boolean Formula (QBF) satisfiability solvers. In particular, we propose (i) two CHAFF-like literal watching schemes for unit clause detection; and (ii) two other watched data structures, one for detecting pure literals and the other for detecting void quantifiers. We have conducted an experimental evaluation of the proposed data structures, using both randomly generated and real-world benchmarks. Our results indicate that clause watching is very effective, while the 2 and 3 literal watching data structures become more effective as the clause length increases. The quantifier watching structure does not appear to be effective on the instances considered. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-24605-3_3 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
data structure,sat solver | Data structure,Discrete mathematics,Computer science,Chaff | Conference |
Volume | ISSN | Citations |
2919 | 0302-9743 | 18 |
PageRank | References | Authors |
0.85 | 5 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ian P. Gent | 1 | 2438 | 246.99 |
| Enrico Giunchiglia | 2 | 2380 | 164.28 |
| Massimo Narizzano | 3 | 451 | 30.41 |
| Andrew G. D. Rowley | 4 | 53 | 3.44 |
| Armando Tacchella | 5 | 1448 | 108.82 |