On the public citation graph

An Improved General Path Order

https://doi.org/10.1007/bf01293264
0 signed · 31 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-15198-2_11openalex-snapshot
A path ordering for proving termination of term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-56393-8_15openalex-snapshot
A constructor-based approach for positive/negative-conditional equational specifications
inferredcites →https://doi.org/10.1007/3-540-56868-9_16openalex-snapshot
Topics in termination
inferredcites →https://doi.org/10.1007/3-540-59200-8_82openalex-snapshot
Problems in rewriting III
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bf00302640openalex-snapshot
On the recursive decomposition ordering with lexicographical status and other related orderings
inferredcites →https://doi.org/10.1007/bf01810293openalex-snapshot
Termination by completion
inferredcites →https://doi.org/10.1007/bfb0012855openalex-snapshot
Canonical conditional rewrite systems
inferredcites →https://doi.org/10.1016/0020-0190(79)90071-1openalex-snapshot
A note on simplification orderings
inferredcites →https://doi.org/10.1016/0020-0190(87)90122-0openalex-snapshot
Counterexamples to termination for the direct sum of term rewriting systems
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(92)90022-8openalex-snapshot
Simulation of Turing machines by a regular rewrite rule
inferredcites →https://doi.org/10.1016/0304-3975(94)00275-4openalex-snapshot
Natural termination
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
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.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/359138.359142openalex-snapshot
Proving termination with multiset orderings
inferredcites →https://doi.org/10.2307/2025598openalex-snapshot
Godel, Escher, Bach: An Eternal Golden Braid.
inferredcites →https://doi.org/10.2307/832610openalex-snapshot
Gödel, Escher, Bach: An Eternal Golden Braid
inferredcites →https://doi.org/10.3233/fi-1995-24124openalex-snapshot
TERMINATION OF TERM REWRITING BY SEMANTIC LABELLING

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-48685-2_12openalex-snapshot
Theory Path Orderings
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_43openalex-snapshot
Termination of constructor systems
inferred← citeshttps://doi.org/10.1007/978-3-031-43369-6_4openalex-snapshot
Weighted Path Orders Are Semantic Path Orders
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_1openalex-snapshot
Termination by Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_33openalex-snapshot
Ordinals and Knuth-Bendix Orders
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00275-4openalex-snapshot
Natural termination
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.05.005openalex-snapshot
Shallow confluence of conditional term rewriting systems
inferred← citeshttps://doi.org/10.1016/j.scico.2014.07.009openalex-snapshot
A unified ordering for termination proving
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.48550/arxiv.1309.6226openalex-snapshot
Automation of Mathematical Induction as part of the History of Logic
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.