On the public citation graph
A compiler for rewrite programs in associative-commutative theories
0 signed · 49 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.1006/inco.1996.0042openalex-snapshot
Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories
inferredcites →https://doi.org/10.1006/jsco.1994.1049openalex-snapshot
Tree Automata Help One To Solve Equational Formulae In AC-Theories
inferredcites →https://doi.org/10.1007/3-540-16780-3_140openalex-snapshot
RRL: A rewrite rule laboratory
inferredcites →https://doi.org/10.1007/3-540-53982-4_4openalex-snapshot
Compilation of pattern matching with associative-commutative functions
inferredcites →https://doi.org/10.1007/3-540-56610-4_56openalex-snapshot
Associative-commutative discrimination nets
inferredcites →https://doi.org/10.1007/3-540-61464-8_50openalex-snapshot
A compiler for nondeterministic term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-62950-5_64openalex-snapshot
Rewrite systems for natural, integral, and rational arithmetic
inferredcites →https://doi.org/10.1007/bf00881866openalex-snapshot
Flatterms, discrimination nets, and fast term rewriting
inferredcites →https://doi.org/10.1007/bfb0027016openalex-snapshot
Optimal left-to-right pattern-matching automata
inferredcites →https://doi.org/10.1016/0893-9659(94)90045-0openalex-snapshot
Finding all the perfect matchings in bipartite graphs
inferredcites →https://doi.org/10.1016/s0747-7171(08)80145-9openalex-snapshot
Combining matching algorithms: The regular case
inferredcites →https://doi.org/10.1016/s0747-7171(87)80027-5openalex-snapshot
Complexity of matching problems
inferredcites →https://doi.org/10.1016/s1571-0661(04)00035-0openalex-snapshot
Fast matching in combinations of regular equational theories
inferredcites →https://doi.org/10.1016/s1571-0661(04)00039-8openalex-snapshot
Controlling Rewriting by Rewriting
inferredcites →https://doi.org/10.1093/comjnl/38.5.381openalex-snapshot
Associative-commutative matching via bipartite graph matching
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
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/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.14236/ewic/al1997.11openalex-snapshot
Compilation Techniques for Associative-Commutative Normalisation
inferredcites →https://doi.org/10.14236/ewic/al1997.3openalex-snapshot
Rewriting as a Unified Specification Tool for Logic and Control: The ELAN Language.
inferredcites →https://doi.org/10.2172/10129052openalex-snapshot
OTTER 3.0 reference manual and guide
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2159openalex-snapshot
Effective strategic programming for Java developers
inferred← citeshttps://doi.org/10.1007/10721975_19openalex-snapshot
REM (Reduce Elan Machine): Core of the New ELAN Compiler
inferred← citeshttps://doi.org/10.1007/3-540-44863-2_37openalex-snapshot
Automated Generation of Kinetic Chemical Mechanisms Using Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-44881-0_3openalex-snapshot
Associative-Commutative Rewriting on Large Terms
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_30openalex-snapshot
In Search of a Phase Transition in the AC-Matching Problem
inferred← citeshttps://doi.org/10.1007/3-540-48483-3_12openalex-snapshot
Non-deterministic Computations in ELAN
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_7openalex-snapshot
The Rewriting Calculus as a Semantics of ELAN
inferred← citeshttps://doi.org/10.1007/978-3-540-25979-4_5openalex-snapshot
A Certified AC Matching Algorithm
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.040openalex-snapshot
From Chemical Rules to Term Rewriting
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.054openalex-snapshot
Rules and Strategies in Java
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00357-7openalex-snapshot
Rewriting logic: roadmap and bibliography
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00358-9openalex-snapshot
ELAN from a rewriting logic point of view
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00368-1openalex-snapshot
CASL: the Common Algebraic Specification Language
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80122-7openalex-snapshot
ASF+SDF parsing tools applied to ELAN
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80144-6openalex-snapshot
Handling Relations over Finite Domains in the Rule-Based System ELAN
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82549-6openalex-snapshot
Cooperation of Constraint Solvers: Using the New Process Control Facilities of ELAN
inferred← citeshttps://doi.org/10.1017/s0956796800003907openalex-snapshot
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories
inferred← citeshttps://doi.org/10.1023/a:1020122610698openalex-snapshot
Single Elementary Associative-Commutative Matching
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.3233/fi-1998-34303openalex-snapshot
Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies
inferred← citeshttps://doi.org/10.48550/arxiv.0907.3123openalex-snapshot
Verification of Timed Automata Using Rewrite Rules and Strategies
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0009030openalex-snapshot
From Syntactic Theories to Interpreters: A Specification Language and Its Compilation
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.