The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
ManySAT: a Parallel SAT Solver
Open accessAbstract
In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter tuning and their lack of robustness. ManySAT uses
Overview
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
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595
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
Eén, N., & Sörensson, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24605-3_37 · Cited by 2,629
Nieuwenhuis, R., Oliveras, A., & Tinelli, C. (2006) · Journal of the ACM · doi:10.1145/1217856.1217859 · Cited by 783
Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
Zhang, L., Madigan, C. F., Moskewicz, M. H., & Malik, S. (2001) · Cited by 682
Boosting combinatorial search through randomization
Gomes, C. P., Selman, B., & Kautz, H. (1998) · Cited by 557
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
Optimal speedup of Las Vegas algorithms
Luby, M. G., Sinclair, A., & Zuckerman, D. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90029-9 · Cited by 388
Heuristics based on unit propagation for satisfiability problems
Li, C.-M., & Anbulagan, A. (1997) · Cited by 319
Chaff: engineering an efficient SAT solver
Moskewicz, M., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2002) · Proceedings - ACM IEEE Design Automation Conference · doi:10.1109/dac.2001.935565 · Cited by 279
A Lightweight Component Caching Scheme for Satisfiability Solvers
Pipatsrisawat, K., & Darwiche, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72788-0_28 · Cited by 220
A fast parallel SAT-solver — efficient workload balancing
Böhm, M., & Speckenmeyer, E. (1996) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf02127976 · Cited by 133
Kautz, H., Horvitz, E., Ruan, Y., Gomes, C. P., & Selman, B. (2002) · doi:10.5555/777092.777196 · Cited by 121
A Concurrent Portfolio Approach to SMT Solving
Wintersteiger, C. M., Hamadi, Y., & de Moura, L. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02658-4_60 · Cited by 75
Self-citationParallel propositional satisfiability checking with distributed dynamic learning
Blochinger, W., Sinz, C., & Küchlin, W. (2003) · Parallel Computing · doi:10.1016/s0167-8191(03)00068-1 · Cited by 65
PMSat: a parallel version of MiniSAT
Gil, L., Flores, P. F., & Silveira, L. M. (2008) · Journal on Satisfiability Boolean Modeling and Computation · doi:10.3233/sat190063 · Cited by 55
Experiments with massively parallel constraint solving
Bordeaux, L., Hamadi, Y., & Samulowitz, H. (2009) · Cited by 53
Self-citationA Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
Jurkowiak, B., Li, C.-M., & Utard, G. (2005) · Journal of Automated Reasoning · doi:10.1007/s10817-005-1970-7 · Cited by 47
Boosting Distributed Constraint Satisfaction
Ringwelski, G., & Hamadi, Y. (2005) · Lecture notes in computer science · doi:10.1007/11564751_41 · Cited by 22
Self-citationA SAT-based approach to decipher Gene Regulatory Networks
Corblin, F., Hamadi, Y., Fanchon, É., & Trilling, L. (2007) · Cited by 19
Self-citation
Cited by
Faster sorting algorithms discovered using deep reinforcement learning
Mankowitz, D. J., Michi, A., Zhernov, A., Gelmi, M., Selvi, M., Paduraru, C., Leurent, E., Iqbal, S., Lespiau, J.-B., Ahern, A., et al. (2023) · Nature · doi:10.1038/s41586-023-06004-9 · Cited by 177
Metadata
- Authors
- Hamadi, Y., Jabbour, S., & Sais, L.
- Venue
- Journal on Satisfiability, Boolean Modeling and Computation
- Publisher
- SAGE Publications
- Published
- 2009-06-01
- Volume
- 6
- Issue
- 4
- Pages
- 245-262
- ISSN
- 1574-0617 (ISSN-L)
- OpenAlex
- W2103406309
- Cited by
- 319
- References
- 21
- FWCI
- 35.71
- Type
- journal article
- Language
- en
- Open access
- diamond
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.