On the public citation graph

Total termination of term rewriting

https://doi.org/10.1007/bf01191381

0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jsco.1994.1003openalex-snapshot

Termination of term rewriting: interpretation and type elimination

inferredcites →https://doi.org/10.1007/3-540-51081-8_124openalex-snapshot

Extensions and comparison of simplification orderings

inferredcites →https://doi.org/10.1007/3-540-56393-8_12openalex-snapshot

Termination of term rewriting by interpretation

inferredcites →https://doi.org/10.1007/3-540-58156-1_33openalex-snapshot

Simple termination revisited

inferredcites →https://doi.org/10.1007/3-540-58431-5_15openalex-snapshot

Syntactical analysis of total termination

inferredcites →https://doi.org/10.1007/3-540-60381-6_7openalex-snapshot

Well-foundedness of term orderings

inferredcites →https://doi.org/10.1007/978-3-662-21551-7_17openalex-snapshot

Total termination of term rewriting

inferredcites →https://doi.org/10.1007/bfb0013817openalex-snapshot

Termination of rewrite systems by elementary interpretations

inferredcites →https://doi.org/10.1016/0167-6423(87)90030-xopenalex-snapshot

Termination of rewriting systems by polynomial interpretations and its implementation

inferredcites →https://doi.org/10.1016/0304-3975(92)90289-ropenalex-snapshot

Termination proofs by multiset path orderings imply primitive recursive derivation lengths

inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot

Rewrite Systems

inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot

Termination of rewriting

inferredcites →https://doi.org/10.1109/lics.1993.287573openalex-snapshot

The order types of termination orderings on monadic terms, strings and multisets

inferredcites →https://doi.org/10.1112/blms/14.4.285openalex-snapshot

Accessible Independence Results for Peano Arithmetic

inferredcites →https://doi.org/10.1145/359138.359142openalex-snapshot

Proving termination with multiset orderings

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.2002.3120openalex-snapshot

Relative Undecidability in Term Rewriting

inferred← citeshttps://doi.org/10.1006/jsco.1995.1037openalex-snapshot

Total Termination of Term Rewriting is Undecidable

inferred← citeshttps://doi.org/10.1007/3-540-44622-2_31openalex-snapshot

Equational Termination by Semantic Labelling

inferred← citeshttps://doi.org/10.1007/3-540-63172-0_37openalex-snapshot

Relative undecidability in term rewriting

inferred← citeshttps://doi.org/10.1007/978-3-031-01854-1openalex-snapshot

Datalog and Logic Databases

inferred← citeshttps://doi.org/10.1007/978-3-319-09870-8_7openalex-snapshot

Checking Termination of Logic Programs with Function Symbols through Linear Constraints

inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_33openalex-snapshot

Ordinals and Knuth-Bendix Orders

inferred← citeshttps://doi.org/10.1007/bfb0030600openalex-snapshot

Relative undecidability in the termination hierarchy of single rewrite rules

inferred← citeshttps://doi.org/10.1007/s002000100061openalex-snapshot

The Termination Hierarchy for Term Rewriting

inferred← citeshttps://doi.org/10.1007/s002000100062openalex-snapshot

Termination Proofs for Ground Rewrite Systems - Interpretations and Derivational Complexity

inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50011-4openalex-snapshot

Rewriting

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00172-7openalex-snapshot

Simple termination of rewrite systems

inferred← citeshttps://doi.org/10.1016/s0890-5401(02)93120-2openalex-snapshot

Relative Undecidability in Term RewritingI. The Termination Hierarchy

inferred← citeshttps://doi.org/10.1017/s147106841300046xopenalex-snapshot

Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments

inferred← citeshttps://doi.org/10.1017/s1471068414000623openalex-snapshot

Checking termination of bottom-up evaluation of logic programs with function symbols

inferred← citeshttps://doi.org/10.1017/s1471068416000077openalex-snapshot

Using linear constraints for logic program termination analysis

inferred← citeshttps://doi.org/10.2307/2275551openalex-snapshot

The order types of termination orderings on monadic terms, strings and multisets

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.