The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
The Sat4j library, release 2.2: System description
Open accessAbstract
Sat4j is a mature, open source library of SAT-based solvers in Java.It provides a modular SAT solver architecture designed to work with generic constraints.Such architecture is used to provide SAT, MaxSat and pseudo-boolean and solvers for lightweight constraint programming.Those solvers have been evaluated regularly in the corresponding international competitive events.The library has been adopted by several academic softwares and the widely used Eclipse platform, which relies on a pseudo-boolean solver from Sat4j for its plugins dependencies management since June 2008.
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
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
Feature Models, Grammars, and Propositional Formulas
Batory, D. S. (2005) · Lecture notes in computer science · doi:10.1007/11554844_3 · Cited by 1,255
Predicting learnt clauses quality in modern SAT solvers
Audemard, G., & Simon, L. (2009) · Cited by 498
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
de Jong, H., & Page, M. (2008) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2007.70254 · Cited by 65
Cited by
Shoukry, Y., Nuzzo, P., Puggelli, A., Sangiovanni-Vincentelli, A. L., Seshia, S. A., & Tabuada, P. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2676679 · Cited by 311
Variability-aware parsing in the presence of lexical macros and conditional compilation
Kästner, C., Giarrusso, P. G., Rendel, T., Erdweg, S., Ostermann, K., & Berger, T. (2011) · Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications · doi:10.1145/2048066.2048128 · Cited by 282
Program synthesis using conflict-driven learning
Feng, Y., Martins, R., Bastani, O., & Dillig, I. (2018) · Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3192366.3192382 · Cited by 111
Metadata
- Authors
- Le Berre, D., & Parrain, A.
- Venue
- Journal on Satisfiability, Boolean Modeling and Computation
- Publisher
- SAGE Publications
- Published
- 2010-07-01
- Volume
- 7
- Issue
- 2-3
- Pages
- 59-64
- ISSN
- 1574-0617 (ISSN-L)
- OpenAlex
- W5815757
- Cited by
- 455
- References
- 5
- FWCI
- 49.82
- 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.