The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Solving propositional satisfiability problems
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
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
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
Linear-time algorithms for testing the satisfiability of propositional horn formulae
Dowling, W. F., & Gallier, J. H. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90014-1 · Cited by 1,013
Automated Theorem Proving: A Logical Basis
Loveland, D. W. (1978) · Medical Entomology and Zoology · Cited by 667
Some results and experiments in programming techniques for propositional logic
Blair, C., Jeroslow, R. G., & Lowe, J. K. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90056-0 · Cited by 122
Self-citationA Human Oriented Logic for Automatic Theorem-Proving
Nevins, A. J. (1974) · Journal of the ACM · doi:10.1145/321850.321858 · Cited by 69
Cited by
The Quest for Efficient Boolean Satisfiability Solvers
Zhang, L., & Malik, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45657-0_2 · Cited by 279
Learning action models from plan examples using weighted MAX-SAT
Yang, Q., Wu, K., & Jiang, Y. (2007) · Artificial Intelligence · doi:10.1016/j.artint.2006.11.005 · Cited by 206
Metadata
- Authors
- Jeroslow, R. G., & Wang, J.
- Venue
- Annals of Mathematics and Artificial Intelligence
- Published
- 1990-09
- Volume
- 1
- Issue
- 1-4
- Pages
- 167-187
- ISSN
- 1012-2443 (ISSN-L)
- 1573-7470
- OpenAlex
- W2085301456
- Cited by
- 270
- References
- 8
- FWCI
- 8.00
- 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
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.