On the public citation graph
Canonical conditional rewrite systems
0 signed · 64 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-19242-5_14openalex-snapshot
A logical analysis on theory of conditional rewriting
inferredcites →https://doi.org/10.1007/3-540-19242-5_3openalex-snapshot
Confluence of conditional rewrite systems
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/978-3-662-09691-8_11openalex-snapshot
Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence
inferredcites →https://doi.org/10.1016/0022-0000(86)90033-4openalex-snapshot
Conditional rewrite rules: Confluence and termination
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(87)80010-xopenalex-snapshot
Simplifying conditional term rewriting systems : Unification, termination and confluence
inferredcites →https://doi.org/10.1090/conm/065/891255openalex-snapshot
On the theory of quasi-ordinal diagrams
inferredcites →https://doi.org/10.1109/lics.1988.5108openalex-snapshot
Proof-theoretic techniques for term rewriting theory
inferredcites →https://doi.org/10.2307/2005152openalex-snapshot
Computational Problems in Abstract Algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1993.1027openalex-snapshot
Modular Properties of Conditional Term Rewriting Systems
inferred← citeshttps://doi.org/10.1006/inco.2000.2888openalex-snapshot
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems
inferred← citeshttps://doi.org/10.1006/jsco.1994.1004openalex-snapshot
A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications
inferred← citeshttps://doi.org/10.1006/jsco.1995.1036openalex-snapshot
Modular Properties of Composable Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/11601548_22openalex-snapshot
Expression Reduction Systems and Extensions: An Overview
inferred← citeshttps://doi.org/10.1007/11805618_3openalex-snapshot
Computationally Equivalent Elimination of Conditions
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_3openalex-snapshot
Confluence of conditional rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_8openalex-snapshot
Applying Rewriting Techniques to the Verification of Erlang Processes
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_8openalex-snapshot
Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_101openalex-snapshot
Complete sets of reductions with constraints
inferred← citeshttps://doi.org/10.1007/3-540-53162-9_46openalex-snapshot
Equation solving in conditional AC-theories
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_79openalex-snapshot
Extended term 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_99openalex-snapshot
Confluence of the disjoint union of conditional term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_8openalex-snapshot
Combinations of simplifying conditional term rewriting 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-58431-5_14openalex-snapshot
On modularity of termination and confluence properties of conditional rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_18openalex-snapshot
Modular properties of constructor-sharing conditional term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_7openalex-snapshot
Unravelings and ultra-properties
inferred← citeshttps://doi.org/10.1007/978-1-4612-3658-0_11openalex-snapshot
Automated Theorem Proving for Analysis and Synthesis of Computations
inferred← citeshttps://doi.org/10.1007/bf00249354openalex-snapshot
Inductive expansion: A calculus for verifying and synthesizing functional and logic programs
inferred← citeshttps://doi.org/10.1007/bf00881856openalex-snapshot
Implicit induction in conditional theories
inferred← citeshttps://doi.org/10.1007/bf01190830openalex-snapshot
Completeness results for basic narrowing
inferred← citeshttps://doi.org/10.1007/bf01209624openalex-snapshot
Proving termination of (conditional) rewrite systems
inferred← citeshttps://doi.org/10.1007/bfb0013830openalex-snapshot
Counterexamples to completeness results for basic narrowing (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0030592openalex-snapshot
Logicality of conditional rewrite systems
inferred← citeshttps://doi.org/10.1007/bfb0032044openalex-snapshot
Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond
inferred← citeshttps://doi.org/10.1007/bfb0058025openalex-snapshot
On the expressive power of rewriting
inferred← citeshttps://doi.org/10.1007/s002000100063openalex-snapshot
Verification of Erlang Processes by Dependency Pairs
inferred← citeshttps://doi.org/10.1007/s10617-012-9087-9openalex-snapshot
Representation of synchronous, asynchronous, and polychronous components by clocked guarded actions
inferred← citeshttps://doi.org/10.1007/s10817-004-6246-0openalex-snapshot
Reachability Analysis over Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/s10817-006-9065-7openalex-snapshot
Structures for Abstract Rewriting
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90064-oopenalex-snapshot
A rationale for conditional equational programming
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90289-ropenalex-snapshot
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
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.1016/0743-1066(94)00024-zopenalex-snapshot
Analyses of unsatisfiability for equational logic programming
inferred← citeshttps://doi.org/10.1016/j.entcs.2002.09.008openalex-snapshot
Conditional Term Graph Rewriting with Indirect Sharing
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100680openalex-snapshot
Applications and extensions of context-sensitive rewriting
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.05.005openalex-snapshot
Shallow confluence of conditional term rewriting systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00210-8openalex-snapshot
Logicality of conditional rewrite systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80658-3openalex-snapshot
Reachability in Conditional Term Rewriting Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80193-8openalex-snapshot
Context-sensitive Conditional Expression Reduction Systems
inferred← citeshttps://doi.org/10.1017/s096012951800035xopenalex-snapshot
Probabilistic logic over equations and domain restrictions
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/888251.888264openalex-snapshot
Simplification and termination of strategies in rule-based languages
inferred← citeshttps://doi.org/10.3166/tsi.22.401-433openalex-snapshot
Une approche générique de la réécriture
inferred← citeshttps://doi.org/10.3233/fi-1995-24125openalex-snapshot
CONTEXTUAL REWRITING IN AUTOMATED REASONING
inferred← citeshttps://doi.org/10.4204/eptcs.289.5openalex-snapshot
On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions
inferred← citeshttps://doi.org/10.70675/b8a9d0a9zdc25z41ceza2cazff3641f6087eopenalex-snapshot
A type system for embedded rewriting programming
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.