On the public citation graph

Hierarchical contextual rewriting with several levels

https://doi.org/10.1007/bfb0035845
0 signed · 25 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-15976-2_2openalex-snapshot
Contextual rewriting
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/bfb0032832openalex-snapshot
On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems
inferredcites →https://doi.org/10.1007/bfb0039613openalex-snapshot
Ground term confluence in parametric conditional equational specifications
inferredcites →https://doi.org/10.1016/0004-3702(85)90074-8openalex-snapshot
Refutational theorem proving using term-rewriting systems
inferredcites →https://doi.org/10.1016/0022-0000(81)90002-7openalex-snapshot
A complete proof of correctness of the Knuth-Bendix completion algorithm
inferredcites →https://doi.org/10.1016/b978-0-12-046371-8.50011-0openalex-snapshot
Completion Algorithms for Conditional Rewriting Systems11This work was partially supported by the GRECO de Programmation of the CNRS.
inferredcites →https://doi.org/10.1016/c2013-0-02156-1openalex-snapshot
Computational Problems in Abstract Algebra
inferredcites →https://doi.org/10.1016/s0747-7171(87)80010-xopenalex-snapshot
Simplifying conditional term rewriting systems : Unification, termination and confluence
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1137/0215084openalex-snapshot
Completion of a Set of Rules Modulo a Set of Equations
inferredcites →https://doi.org/10.1145/69622.357192openalex-snapshot
Data Type Specification: Parameterization and the Power of Specification Techniques
inferredcites →https://doi.org/10.2307/1968867openalex-snapshot
On Theories with a Combinatorial Definition of "Equivalence"

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-19242-5_2openalex-snapshot
Hierarchical contextual rewriting with several levels
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_21openalex-snapshot
REVEUR4: A laboratory for conditional rewriting
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_61openalex-snapshot
A completion procedure for hierarchical conditional rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_91openalex-snapshot
Proof by consistency in conditional equational theories
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_97openalex-snapshot
On sufficient completeness of conditional specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1007/bf01178578openalex-snapshot
Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
inferred← citeshttps://doi.org/10.1007/bfb0039631openalex-snapshot
REVEUR4 : A laboratory for conditional rewriting
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50011-0openalex-snapshot
Completion Algorithms for Conditional Rewriting Systems11This work was partially supported by the GRECO de Programmation of the CNRS.
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00366-8openalex-snapshot
Equational rules for rewriting logic
inferred← citeshttps://doi.org/10.1109/ride.1994.282841openalex-snapshot
Conditional term rewriting as a formal basis for analysis of active database rules
inferred← citeshttps://doi.org/10.1145/112515.112529openalex-snapshot
An OBJ3 functional specification for boundary representation
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.