On the public citation graph
Generalized sufficient conditions for modular termination of rewriting
0 signed · 36 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-51081-8_113openalex-snapshot
Modular aspects of properties of term rewriting systems related to normal forms
inferredcites →https://doi.org/10.1007/3-540-51081-8_127openalex-snapshot
Termination for the direct sum of left-linear term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-53904-2_96openalex-snapshot
Completeness of combinations of constructor systems
inferredcites →https://doi.org/10.1007/3-540-54317-1_99openalex-snapshot
Confluence of the disjoint union of conditional term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-56393-8_6openalex-snapshot
Completeness of combinations of conditional constructor systems
inferredcites →https://doi.org/10.1007/3-540-56393-8_8openalex-snapshot
Combinations of simplifying conditional term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-56393-8_9openalex-snapshot
Sufficient conditions for modular termination of conditional term rewriting systems
inferredcites →https://doi.org/10.1007/bfb0013069openalex-snapshot
Relating innermost, weak, uniform and modular termination of term rewriting 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)90039-1openalex-snapshot
On termination of the direct sum of term-rewriting systems
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/0020-0190(90)90221-iopenalex-snapshot
Modular term rewriting systems and the termination
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)90015-8openalex-snapshot
Modularity of simple termination of term rewriting systems with shared constructors
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.1109/lics.1989.39194openalex-snapshot
A sufficient condition for the termination of the direct sum of term rewriting systems
inferredcites →https://doi.org/10.1145/7531.7534openalex-snapshot
On the Church-Rosser property for the direct sum of 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.1006/jsco.1994.1002openalex-snapshot
Completeness of Combinations of Conditional Constructor Systems
inferred← citeshttps://doi.org/10.1006/jsco.1994.1003openalex-snapshot
Termination of term rewriting: interpretation and type elimination
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_6openalex-snapshot
Completeness of combinations of conditional constructor systems
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_9openalex-snapshot
Sufficient conditions for modular termination of conditional term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_48openalex-snapshot
Completeness of hierarchical combinations of term rewriting systems
inferred← citeshttps://doi.org/10.1007/978-3-540-74835-9_38openalex-snapshot
Modular Access Control Via Strategic Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_28openalex-snapshot
Quasi-interpretation Synthesis by Decomposition
inferred← citeshttps://doi.org/10.1007/bfb0013069openalex-snapshot
Relating innermost, weak, uniform and modular termination of term rewriting systems
inferred← citeshttps://doi.org/10.1007/bfb0016858openalex-snapshot
On modularity in term rewriting and narrowing
inferred← citeshttps://doi.org/10.1007/bfb0017487openalex-snapshot
On the modularity of confluence of constructor-sharing term rewriting systems
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00042-4openalex-snapshot
On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
inferred← citeshttps://doi.org/10.3233/fi-1995-24121openalex-snapshot
ABSTRACT RELATIONS BETWEEN RESTRICTED TERMINATION AND CONFLUENCE PROPERTIES OF REWRITE SYSTEMS
inferred← citeshttps://doi.org/10.3233/fi-1995-24123openalex-snapshot
SIMPLIFICATION ORDERINGS: HISTORY OF RESULTS
inferred← citeshttps://doi.org/10.70675/33551aa7z7e96z4b24zbaa1zbe39a011a93dopenalex-snapshot
Rewriting and modularity for security policies
inferred← citeshttps://doi.org/10.70675/f1838cb3zfc72z4859z92fezc8cec6a04a5eopenalex-snapshot
Analyse de la complexité des programmes par interprétation sémantique
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.