On the public citation graph

Termination by completion

https://doi.org/10.1007/bf01810293
0 signed · 51 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.1007/3-540-16780-3_76openalex-snapshot
Commutation, transformation, and termination
inferredcites →https://doi.org/10.1007/3-540-50939-9_123openalex-snapshot
Completion procedures as transition rules + control
inferredcites →https://doi.org/10.1007/3-540-51081-8_103openalex-snapshot
Simulation of Turing machines by a left-linear rewrite rule
inferredcites →https://doi.org/10.1007/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1016/0167-6423(86)90017-1openalex-snapshot
Rewriting systems on FP expressions to reduce the number of sequences yielded
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(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1016/0304-3975(86)90035-6openalex-snapshot
Proof of termination of the rewriting system subst on CCL
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1016/s0747-7171(87)80023-8openalex-snapshot
Path of subterms ordering and recursive decomposition ordering revisited
inferredcites →https://doi.org/10.1109/lics.1988.5122openalex-snapshot
Proof by consistency in equational theories
inferredcites →https://doi.org/10.1109/sfcs.1977.9openalex-snapshot
Conflunt reductions: Abstract properties and applications to term rewriting systems
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10721959_25openalex-snapshot
Eliminating Dummy Elimination
inferred← citeshttps://doi.org/10.1007/10721959_27openalex-snapshot
Complete Monotonic Semantic Path Orderings
inferred← citeshttps://doi.org/10.1007/11601548_12openalex-snapshot
Reducing Right-Hand Sides for Termination
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_49openalex-snapshot
Approximating Dependency Graphs Using Tree Automata Techniques
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_99openalex-snapshot
Program transformation and rewriting
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_44openalex-snapshot
Automatic termination proofs with transformation orderings
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_46openalex-snapshot
A complete characterization of termination of 0p 1q→1r 0s
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_56openalex-snapshot
Dummy elimination: Making termination easier
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_38openalex-snapshot
Termination analysis for functional programs using term orderings
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_6openalex-snapshot
Hierarchical termination
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_43openalex-snapshot
Termination of constructor systems
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_44openalex-snapshot
Dummy elimination in equational rewriting
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_101openalex-snapshot
Transforming termination by self-labelling
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_68openalex-snapshot
Proving innermost normalisation automatically
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_69openalex-snapshot
Termination of context-sensitive rewriting
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_71openalex-snapshot
Innocuous constructor-sharing combinations
inferred← citeshttps://doi.org/10.1007/978-3-0348-8800-4_10openalex-snapshot
New Directions for Syntactic Termination Orderings
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_1openalex-snapshot
Termination by Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_4openalex-snapshot
Automating the Dependency Pair Method
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_6openalex-snapshot
Termination Analysis for Functional Programs
inferred← citeshttps://doi.org/10.1007/bf01214624openalex-snapshot
Termination of rewrite systems by elementary interpretations
inferred← citeshttps://doi.org/10.1007/bf01293264openalex-snapshot
An Improved General Path Order
inferred← citeshttps://doi.org/10.1007/bfb0013817openalex-snapshot
Termination of rewrite systems by elementary interpretations
inferred← citeshttps://doi.org/10.1007/bfb0030602openalex-snapshot
Automatically proving termination where simplification orderings fail
inferred← citeshttps://doi.org/10.1007/bfb0052376openalex-snapshot
Towards automated termination proofs through “freezing”
inferred← citeshttps://doi.org/10.1007/bfb0055773openalex-snapshot
Reducing AC-termination to termination
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50011-4openalex-snapshot
Rewriting
inferred← citeshttps://doi.org/10.1016/j.ic.2004.10.004openalex-snapshot
Automating the dependency pair method
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.04.001openalex-snapshot
Abstract abstract reduction
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.013openalex-snapshot
Jumping and escaping: Modular termination and the abstract path ordering
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00254-xopenalex-snapshot
Termination modulo equations by abstract commutation with an application to iteration
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00207-8openalex-snapshot
Termination of term rewriting using dependency pairs
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80124-0openalex-snapshot
Termination and normalisation under strategy Proofs in ELAN
inferred← citeshttps://doi.org/10.1017/s0956796803004945openalex-snapshot
Transformation techniques for context-sensitive rewrite systems
inferred← citeshttps://doi.org/10.1017/s0960129518000221openalex-snapshot
Finding small counterexamples for abstract rewriting properties
inferred← citeshttps://doi.org/10.1023/a:1005797629953openalex-snapshot
Termination of Nested and Mutually Recursive Algorithms
inferred← citeshttps://doi.org/10.3233/fi-1995-24124openalex-snapshot
TERMINATION OF TERM REWRITING BY SEMANTIC LABELLING
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.