On the public citation graph

RRL: A rewrite rule laboratory

https://doi.org/10.1007/bfb0012889
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.1007/3-540-16780-3_140openalex-snapshot
RRL: A rewrite rule laboratory
inferredcites →https://doi.org/10.1007/978-1-4613-2007-4_7openalex-snapshot
Hardware Verification in the Interactive VHDL Workstation
inferredcites →https://doi.org/10.1007/bfb0012820openalex-snapshot
First-order theorem proving using conditional rewrite rules
inferredcites →https://doi.org/10.1007/bfb0012831openalex-snapshot
A mechanizable induction principle for equational specifications
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50028-xopenalex-snapshot
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
inferredcites →https://doi.org/10.1109/dac.1988.14760openalex-snapshot
Formal verification of the Sobel image processing chip

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-51081-8_129openalex-snapshot
Consider only general superpositions in completion procedures
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_138openalex-snapshot
An overview of Rewrite Rule Laboratory (RRL)
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_108openalex-snapshot
Incremental techniques for efficient normalization of nonlinear rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_17openalex-snapshot
On fairness in distributed automated deduction
inferred← citeshttps://doi.org/10.1007/3-540-59340-3_5openalex-snapshot
Some extensions of rewriting
inferred← citeshttps://doi.org/10.1007/3-540-60275-5_71openalex-snapshot
Deep embedding VHDL
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_72openalex-snapshot
Termination of theorem proving by reuse
inferred← citeshttps://doi.org/10.1007/3-540-61532-6_32openalex-snapshot
On semantic resolution with lemmaizing and contraction
inferred← citeshttps://doi.org/10.1007/978-1-4613-2007-4_7openalex-snapshot
Hardware Verification in the Interactive VHDL Workstation
inferred← citeshttps://doi.org/10.1007/978-3-0348-8800-4_13openalex-snapshot
Finding a Finite Group Presentation Using Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_1openalex-snapshot
Rewriting, Inference, and Proof
inferred← citeshttps://doi.org/10.1007/bf00297251openalex-snapshot
Opening the AC-unification race
inferred← citeshttps://doi.org/10.1007/bf00881859openalex-snapshot
A path ordering for proving termination of AC rewrite systems
inferred← citeshttps://doi.org/10.1007/bf00881888openalex-snapshot
On subsumption in distributed derivations
inferred← citeshttps://doi.org/10.1007/bf00881905openalex-snapshot
Competing for theAC-Unification Race
inferred← citeshttps://doi.org/10.1007/bf00881910openalex-snapshot
Parallelization of deduction strategies: An analytical study
inferred← citeshttps://doi.org/10.1007/bf02090774openalex-snapshot
Unnecessary inferences in associative-commutative completion procedures
inferred← citeshttps://doi.org/10.1007/bf03037315openalex-snapshot
On semantic resolution with lemmaizing and contraction and a formal treatment of caching
inferred← citeshttps://doi.org/10.1007/bfb0013183openalex-snapshot
Distributed deduction by Clause-Diffusion: the aquarius prover
inferred← citeshttps://doi.org/10.1007/bfb0031809openalex-snapshot
A unified approach for combining different formalisms for hardware verification
inferred← citeshttps://doi.org/10.1007/bfb0055071openalex-snapshot
A good class of tree automata. Application to inductive theorem proving
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90047-7openalex-snapshot
The term rewriting approach to automated theorem proving
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80133-2openalex-snapshot
Automating inductionless induction using test sets
inferred← citeshttps://doi.org/10.1109/date.1999.761098openalex-snapshot
Verifying imprecisely working arithmetic circuits
inferred← citeshttps://doi.org/10.1109/synasc51798.2020.00025openalex-snapshot
SPIKE, an automatic theorem prover — revisited
inferred← citeshttps://doi.org/10.29007/vbfpopenalex-snapshot
Rewriting and Inductive Reasoning
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.