The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Termination of rewriting
Open accessOverview
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
Simple Word Problems in Universal Algebras
Knuth, D. E., & BENDIX, P. B. (1983) · Springer eBooks · doi:10.1007/978-3-642-81955-1_23 · Cited by 1,368
A Decision Method for Elementary Algebra and Geometry
Tarski, A., & McKinsey, J. C. C. (1951) · University of California Press eBooks · doi:10.1525/9780520348097 · Cited by 1,206
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
Huet, G. (1980) · Journal of the ACM · doi:10.1145/322217.322230 · Cited by 1,115
Ordering by Divisibility in Abstract Algebras
Higman, G. (1952) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s3-2.1.326 · Cited by 1,078
To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism
Curry, H. B., Hindley, J. R., & Seldin, J. P. (1980) · Academic Press eBooks · Cited by 924
Equations and Rewrite Rules: A Survey
Huet, G., & Oppen, D. C. (1980) · Formal Language Theory · doi:10.1016/b978-0-12-115350-2.50017-8 · Cited by 714
Mathematical Theory of Computation
Manna, Z. (1972) · CERN Document Server (European Organization for Nuclear Research) · Cited by 697
On Theories with a Combinatorial Definition of "Equivalence"
Newman, M. H. A. (1942) · Annals of Mathematics · doi:10.2307/1968867 · Cited by 664
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
Collins, G. E. (1975) · Lecture Notes in Computer Science · doi:10.1007/3-540-07407-4_17 · Cited by 655
Mathematical Theory of Computation
McCarthy, J. (1991) · doi:10.21236/ada239419 · Cited by 635
Cited by
DERSHOWITZ, N., & JOUANNAUD, J.-P. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50011-1 · Cited by 579
Self-citationControlling generalization and polyvariance in partial deduction of normal logic programs
Leuschel, M., Martens, B., & De Schreye, D. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271525 · Cited by 88
A general criterion for avoiding infinite unfolding during partial deduction
Bruynooghe, M., De Schreye, D., & Martens, B. (1992) · New Generation Computing · doi:10.1007/bf03037527 · Cited by 67
Automatic finite unfolding using well-founded measures
Martens, B., & De Schreye, D. (1996) · The Journal of Logic Programming · doi:10.1016/0743-1066(95)00149-2 · Cited by 37
Martin, J., & Leuschel, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46562-6_9 · Cited by 12
Metadata
- Authors
- Dershowitz, N.
- Venue
- Journal of Symbolic Computation
- Publisher
- Elsevier BV
- Published
- 1987-02
- Volume
- 3
- Issue
- 1-2
- Pages
- 69-115
- ISSN
- 0747-7171 (ISSN-L)
- OpenAlex
- W2121757274
- Cited by
- 713
- References
- 39
- FWCI
- 23.94
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Termination of rewriting. https://app.cochat.ai/papers/10.1016/s0747-7171(87)80022-6
- The paper
- Dershowitz, N. (1987). Termination of rewriting. Journal of Symbolic Computation. https://doi.org/10.1016/s0747-7171(87)80022-6
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.