The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
The Quest for Efficient Boolean Satisfiability Solvers
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
A machine program for theorem-proving
Davis, M., Logemann, G., & Loveland, D. (1962) · Communications of the ACM · doi:10.1145/368273.368557 · Cited by 3,220
Chaff: engineering an efficient SAT solver
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001) · Proceedings of the 38th conference on Design automation - DAC '01 · doi:10.1145/378239.379017 · Cited by 2,940
Self-citationA Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
Symbolic Model Checking without BDDs
Biere, A., Cimatti, A., Clarke, E., & Zhu, Y. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49059-0_14 · Cited by 2,150
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., & Tacchella, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45657-0_29 · Cited by 1,654
GRASP: a search algorithm for propositional satisfiability
Marques-Silva, J. P., & Sakallah, K. A. (1999) · IEEE Transactions on Computers · doi:10.1109/12.769433 · Cited by 1,374
A new method for solving hard satisfiability problems
Selman, B., Levesque, H. J., & Mitchell, D. G. M. (1992) · Cited by 1,156
Kautz, H., & Selman, B. (1992) · Cited by 820
Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
Zhang, L., Madigan, C. F., Moskewicz, M. H., & Malik, S. (2001) · Cited by 682
Self-citationUsing CSP look-back techniques to solve real-world SAT instances
Bayardo, R. J., & Schrag, R. C. (1997) · Cited by 592
A Structure-preserving Clause Form Translation
Plaisted, D. A., & Greenbaum, S. (1986) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(86)80028-1 · Cited by 582
Boosting combinatorial search through randomization
Gomes, C. P., Selman, B., & Kautz, H. (1998) · Cited by 557
Symbolic Model Checking without BDDs
Biere, A., Cimatti, A., Clark, E., & Zhu, Y. (1999) · doi:10.21236/ada360973 · Cited by 537
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
Prosser, P. (1993) · Computational Intelligence · doi:10.1111/j.1467-8640.1993.tb00310.x · Cited by 528
Local search strategies for satisfiability testing
Selman, B., Kautz, H., & Cohen, B. (1996) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/026/25 · Cited by 516
SATO: An efficient propositional prover
Zhang, H. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63104-6_28 · Cited by 515
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Gomes, C. P., Selman, B., Crato, N., & Kautz, H. (2000) · Journal of Automated Reasoning · doi:10.1023/a:1006314320276 · Cited by 395
An Economics Approach to Hard Computational Problems
Huberman, B. A., Lukose, R. M., & Hogg, T. (1997) · Science · doi:10.1126/science.275.5296.51 · Cited by 390
Logic Synthesis and Verification Algorithms
(2002) · Kluwer Academic Publishers eBooks · doi:10.1007/b117060 · Cited by 388
Combinational test generation using satisfiability
Stephan, P., Brayton, R. K., & Sangiovanni-Vincentelli, A. L. (1996) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.536723 · Cited by 326
Heuristics based on unit propagation for satisfiability problems
Li, C.-M., & Anbulagan, A. (1997) · Cited by 319
Solving propositional satisfiability problems
Jeroslow, R. G., & Wang, J. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531077 · Cited by 270
Improvements to propositional satisfiability search algorithms
Freeman, J. (1995) · Cited by 265
Kunz, W., & Pradhan, D. K. (1994) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.310903 · Cited by 214
Experimental results on the crossover point in satisfiability problems
Crawford, J. M., & Auton, L. D. (1993) · Cited by 209
Finding bugs with a constraint solver
Jackson, D. N., & Vaziri, M. (2000) · ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) · doi:10.1145/347324.383378 · Cited by 209
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
Marques-Silva, J. P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48159-1_5 · Cited by 163
Pruning Techniques for the SAT-Based Bounded Model Checking Problem
Shtrichman, O. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44798-9_4 · Cited by 142
Branching rules for satisfiability
Hooker, J., & Vinay, V. (1995) · Journal of Automated Reasoning · doi:10.1007/bf00881805 · Cited by 133
Integrating Equivalency Reasoning into Davis-Putnam Procedure
Li, C.-M. (2000) · Cited by 123
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
Ganai, M., Ashar, P. N., Gupta, A., Zhang, L., & Malik, S. (2002) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/513918.514105 · Cited by 113
Self-citationKunz, W., & Pradhan, D. K. (2005) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/tutcas.2003.1490927 · Cited by 75
The Propositional Formula Checker HeerHugo
Groote, J. F., & Warners, J. P. (2000) · Journal of Automated Reasoning · doi:10.1023/a:1006366304347 · Cited by 59
Cited by
SATzilla: Portfolio-based Algorithm Selection for SAT
Xu, L., Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2490 · Cited by 857
A survey of recent advances in SAT-based formal verification
Prasad, M. R., Biere, A., & Gupta, A. (2005) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-004-0183-4 · Cited by 279
Metadata
- Authors
- Zhang, L., & Malik, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 17-36
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1923495615
- Cited by
- 279
- References
- 35
- FWCI
- 10.94
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.