The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
DPLL(T): Fast Decision Procedures
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
Zhang, L., Madigan, C. F., Moskewicz, M. H., & Malik, S. (2001) · Cited by 682
Fast Decision Procedures Based on Congruence Closure
Nelson, G., & Oppen, D. C. (1980) · Journal of the ACM · doi:10.1145/322186.322198 · Cited by 513
Variations on the Common Subexpression Problem
Downey, P. J., Sethi, R., & Tarjan, R. E. (1980) · Journal of the ACM · doi:10.1145/322217.322228 · Cited by 368
BerkMin: A fast and robust SAT-solver
Goldberg, E. I., & Novikov, Y. (2003) · Design, Automation, and Test in Europe · doi:10.1109/date.2002.998262 · Cited by 363
Bryant, R. E., Lahiri, S. K., & Seshia, S. A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45657-0_7 · Cited by 240
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
Barrett, C., Dill, D. L., & Stump, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45657-0_18 · Cited by 150
Cited by
Satisfiability Modulo Theories
Barrett, C., & Tinelli, C. (2018) · Handbook of Model Checking · doi:10.1007/978-3-319-10575-8_11 · Cited by 1,122
Self-citationNieuwenhuis, R., Oliveras, A., & Tinelli, C. (2006) · Journal of the ACM · doi:10.1145/1217856.1217859 · Cited by 783
Self-citationBarrett, C., Conway, C. L., Deters, M., Hadarean, L., Jovanović, D., King, T., Reynolds, A., & Tinelli, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22110-1_14 · Cited by 655
Self-citationA Decision Procedure for Bit-Vectors and Arrays
Ganesh, V., & Dill, D. L. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73368-3_52 · Cited by 585
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
- Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., & Tinelli, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 175-188
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1489527380
- Cited by
- 321
- References
- 13
- FWCI
- 19.53
- Type
- conference paper
- 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: DPLL(T): Fast Decision Procedures. https://app.cochat.ai/papers/10.1007/978-3-540-27813-9_14
- The paper
- Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., & Tinelli, C. (2004). DPLL(T): Fast Decision Procedures. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-27813-9_14
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.