On the public citation graph

Termination of associative-commutative rewriting by dependency pairs

https://doi.org/10.1007/bfb0052374
0 signed · 35 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.1006/jsco.1996.0011openalex-snapshot
Normalized Rewriting: an Alternative to Rewriting modulo a Set of Equations
inferredcites →https://doi.org/10.1007/3-540-16780-3_76openalex-snapshot
Commutation, transformation, and termination
inferredcites →https://doi.org/10.1007/3-540-16780-3_78openalex-snapshot
An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations
inferredcites →https://doi.org/10.1007/3-540-56287-7_105openalex-snapshot
Proving polynomials positive
inferredcites →https://doi.org/10.1007/3-540-56868-9_28openalex-snapshot
A precedence-based total AC-compatible ordering
inferredcites →https://doi.org/10.1007/3-540-56868-9_29openalex-snapshot
Extension of the associative path ordering to a chain of associative commutative symbols
inferredcites →https://doi.org/10.1007/3-540-59200-8_77openalex-snapshot
Generating polynomial orderings for termination proofs
inferredcites →https://doi.org/10.1007/3-540-61464-8_70openalex-snapshot
CiME: Completion modulo E
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/3-540-62950-5_67openalex-snapshot
A total, ground path ordering for proving termination of AC-rewrite systems
inferredcites →https://doi.org/10.1007/bfb0030602openalex-snapshot
Automatically proving termination where simplification orderings fail
inferredcites →https://doi.org/10.1016/0020-0190(92)90024-popenalex-snapshot
Associative-commutative reduction orderings
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/0304-3975(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1016/s0747-7171(85)80019-5openalex-snapshot
Termination orderings for associative-commutative rewriting systems
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1016/s0747-7171(88)80018-xopenalex-snapshot
Critical pair criteria for completion
inferredcites →https://doi.org/10.1137/0215084openalex-snapshot
Completion of a Set of Rules Modulo a Set of Equations
inferredcites →https://doi.org/10.1137/1012065openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms (Donald E. Knuth)
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10704567_3openalex-snapshot
Argument Filtering Transformation
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_31openalex-snapshot
Equational Termination by Semantic Labelling
inferred← citeshttps://doi.org/10.1007/3-540-44881-0_20openalex-snapshot
Monotonic AC-Compatible Semantic Path Orderings
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_9openalex-snapshot
Dependency Pairs for Equational Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_42openalex-snapshot
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_49openalex-snapshot
Approximating Dependency Graphs Using Tree Automata Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_15openalex-snapshot
Termination Modulo Combinations of Equational Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_4openalex-snapshot
A Dependency Pair Framework for A ∨ C-Termination
inferred← citeshttps://doi.org/10.1007/s10817-006-9053-yopenalex-snapshot
Elimination Transformations for Associative–Commutative Rewriting Systems
inferred← citeshttps://doi.org/10.1016/j.ic.2008.10.002openalex-snapshot
Generating priority rewrite systems for OSOS process languages
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.02.003openalex-snapshot
Modular and incremental proofs of AC-termination
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00207-8openalex-snapshot
Termination of term rewriting using dependency pairs
inferred← citeshttps://doi.org/10.1017/s0956796803004945openalex-snapshot
Transformation techniques for context-sensitive rewrite systems
inferred← citeshttps://doi.org/10.1145/3062341.3062355openalex-snapshot
Synthesis of divide and conquer parallelism for loops
inferred← citeshttps://doi.org/10.7936/k7h993fgopenalex-snapshot
Knuth-Bendix Completion with Modern Termination Checking, Master's Thesis, August 2006
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.