The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Boolean satisfiability from theoretical hardness to practical success
Abstract
Satisfiability solvers can now be effectively deployed in practical applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Cited by
Satisfiability modulo theories: introduction and applications
De Moura, L., & Bjørner, N. (2011) · Communications of the ACM · doi:10.1145/1995376.1995394 · Cited by 645
Cypher: An Evolving Query Language for Property Graphs
Francis, N., Green, A., Guagliardo, P., Libkin, L., Lindaaker, T., Marsault, V., Plantikow, S., Rydberg, M., Selmer, P., & Taylor, A. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3190657 · Cited by 545
Fomin, F. V., & Kratsch, D. (2010) · Texts in Theoretical Computer Science. An EATCS Series · doi:10.1007/978-3-642-16533-7 · Cited by 471
A general approach to network configuration verification
Beckett, R., Gupta, A., Mahajan, R., & Walker, D. (2017) · Proceedings of the Conference of the ACM Special Interest Group on Data Communication · doi:10.1145/3098822.3098834 · Cited by 262
Towards Verified Artificial Intelligence
Seshia, S. A., Sadigh, D., & Sastry, S. S. (2016) · arXiv · doi:10.48550/arxiv.1606.08514 · Cited by 142
“At the heart of these advances are computational proof engines such as Boolean satisfiability (SAT) solvers [31], Boolean reasoning and manipulation routines based on Binary Decision Diagrams (BDDs) [7], and satisfiability modulo theories (SMT) solvers [4].”
Background
Metadata
- Authors
- Malik, S., & Zhang, L.
- Venue
- Communications of the ACM
- Published
- 2009-08
- Volume
- 52
- Issue
- 8
- Pages
- 76-82
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W1999396796
- Cited by
- 174
- References
- 1
- FWCI
- 9.58
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Boolean satisfiability from theoretical hardness to practical success. https://app.cochat.ai/papers/10.1145/1536616.1536637
- The paper
- Malik, S., & Zhang, L. (2009). Boolean satisfiability from theoretical hardness to practical success. Communications of the ACM. https://doi.org/10.1145/1536616.1536637
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.