Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 174

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

Malik, Sharad, Zhang, Lintao · 2009 · Communications of the ACM

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1536616.1536637

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 174

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.