On the public citation graph

Conditional narrowing modulo a set of equations

https://doi.org/10.1007/bf01202035

0 signed · 43 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-10009-1_25openalex-snapshot

Canonical forms and unification

inferredcites →https://doi.org/10.1007/3-540-15976-2_2openalex-snapshot

Contextual rewriting

inferredcites →https://doi.org/10.1007/3-540-15984-3_328openalex-snapshot

Unification in conditional-equational theories

inferredcites →https://doi.org/10.1007/3-540-16780-3_77openalex-snapshot

Full-commutation and fair-termination in equational (and combined) term-rewriting systems

inferredcites →https://doi.org/10.1007/3-540-50667-5_60openalex-snapshot

Narrowing with built-in theories

inferredcites →https://doi.org/10.1007/3-540-51081-8_99openalex-snapshot

Completion-time optimization of rewrite-time goal solving

inferredcites →https://doi.org/10.1007/3-540-52885-7_95openalex-snapshot

Unification in a combination of equational theories: an efficient algorithm

inferredcites →https://doi.org/10.1007/3-540-53162-9_52openalex-snapshot

AC-Termination of rewrite systems: A modified Knuth-Bendix ordering

inferredcites →https://doi.org/10.1007/3-540-53487-3_40openalex-snapshot

A new method for proving termination of AC-rewrite systems

inferredcites →https://doi.org/10.1007/3-540-53904-2_87openalex-snapshot

Detecting redundant narrowing derivations by the LSE-SL reducibility test

inferredcites →https://doi.org/10.1007/978-0-387-34768-4_11openalex-snapshot

Termination of a Set of Rules Modulo a Set of Equations

inferredcites →https://doi.org/10.1007/978-3-642-73824-1openalex-snapshot

Computing in Horn Clause Theories

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.1007/bfb0012820openalex-snapshot

First-order theorem proving using conditional rewrite rules

inferredcites →https://doi.org/10.1007/bfb0015791openalex-snapshot

Foundations of Equational Logic Programming

inferredcites →https://doi.org/10.1007/bfb0036921openalex-snapshot

Incremental construction of unification algorithms in equational theories

inferredcites →https://doi.org/10.1007/bfb0039613openalex-snapshot

Ground term confluence in parametric conditional equational specifications

inferredcites →https://doi.org/10.1016/0020-0190(92)90024-popenalex-snapshot

Associative-commutative reduction orderings

inferredcites →https://doi.org/10.1016/0167-6423(87)90030-xopenalex-snapshot

Termination of rewriting systems by polynomial interpretations and its implementation

inferredcites →https://doi.org/10.1016/0304-3975(84)90087-2openalex-snapshot

Conditional rewrite rules

inferredcites →https://doi.org/10.1016/0304-3975(90)90064-oopenalex-snapshot

A rationale for conditional equational programming

inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot

Equations and Rewrite Rules: A Survey

inferredcites →https://doi.org/10.1016/c2013-0-10398-4openalex-snapshot

Formal Language Theory

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)80010-xopenalex-snapshot

Simplifying conditional term rewriting systems : Unification, termination and confluence

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.1145/359138.359142openalex-snapshot

Proving termination with multiset orderings

inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot

Constraint logic programming

inferredcites →https://doi.org/10.1145/79204.79210openalex-snapshot

An introduction to Prolog III

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11548133_24openalex-snapshot

Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing

inferred← citeshttps://doi.org/10.1007/3-540-60299-2_25openalex-snapshot

Normalizing narrowing for weakly terminating and confluent systems

inferred← citeshttps://doi.org/10.1007/3-540-60381-6_4openalex-snapshot

LSE narrowing for decreasing conditional term rewrite systems

inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_4openalex-snapshot

Conditional Narrowing Modulo in Rewriting Logic and Maude

inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_2openalex-snapshot

Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude

inferred← citeshttps://doi.org/10.1007/s10817-017-9417-5openalex-snapshot

Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude

inferred← citeshttps://doi.org/10.1007/s10990-007-9000-6openalex-snapshot

Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols

inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.024openalex-snapshot

Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols

inferred← citeshttps://doi.org/10.1016/j.scico.2015.06.001openalex-snapshot

Constrained narrowing for conditional equational theories modulo axioms

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.008openalex-snapshot

Complete symbolic reachability analysis using back-and-forth narrowing

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.12.026openalex-snapshot

Strict coherence of conditional rewriting modulo axioms

inferred← citeshttps://doi.org/10.1145/3131851.3131856openalex-snapshot

Conditional narrowing modulo SMT and axioms

inferred← citeshttps://doi.org/10.1145/3563822.3568017openalex-snapshot

Symbolic Reachability Analysis of Distributed Systems using Narrowing and Heuristic Search

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.