On the public citation graph

Counterexamples to completeness results for basic narrowing (extended abstract)

https://doi.org/10.1007/bfb0013830
0 signed · 46 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-15984-3_328openalex-snapshot
Unification in conditional-equational theories
inferredcites →https://doi.org/10.1007/3-540-17220-3_20openalex-snapshot
Improving basic narrowing techniques
inferredcites →https://doi.org/10.1007/3-540-19242-5_3openalex-snapshot
Confluence of conditional rewrite systems
inferredcites →https://doi.org/10.1007/3-540-50667-5_74openalex-snapshot
Babel: A functional and logic programming language based on constructor discipline and narrowing
inferredcites →https://doi.org/10.1007/3-540-51564-x_51openalex-snapshot
Completeness of extended unification based on basic narrowing
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/3-540-53904-2_90openalex-snapshot
Narrowing directed by a graph of terms
inferredcites →https://doi.org/10.1007/bfb0012855openalex-snapshot
Canonical conditional rewrite systems
inferredcites →https://doi.org/10.1007/bfb0014986openalex-snapshot
Refined strategies for semantic unification
inferredcites →https://doi.org/10.1007/bfb0015791openalex-snapshot
Foundations of Equational Logic Programming
inferredcites →https://doi.org/10.1007/bfb0024197openalex-snapshot
Compiling logic programs with equality
inferredcites →https://doi.org/10.1007/bfb0032044openalex-snapshot
Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond
inferredcites →https://doi.org/10.1016/0022-0000(86)90033-4openalex-snapshot
Conditional rewrite rules: Confluence and termination
inferredcites →https://doi.org/10.1016/0022-0000(91)90009-topenalex-snapshot
Kernel-LEAF: A logic plus functional language
inferredcites →https://doi.org/10.1016/0304-3975(88)90095-3openalex-snapshot
Narrowing vs. SLD-resolution
inferredcites →https://doi.org/10.1016/0304-3975(90)90032-dopenalex-snapshot
On completeness of narrowing strategies
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-444-88074-1.50011-1openalex-snapshot
Rewrite 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.1016/s0747-7171(89)80014-8openalex-snapshot
Basic narrowing revisited
inferredcites →https://doi.org/10.1016/s0747-7171(89)80015-xopenalex-snapshot
Enumerating outer narrowing derivationsfor constructor-based term rewriting systems
inferredcites →https://doi.org/10.1017/9781009498968.017openalex-snapshot
Term Rewriting Systems
inferredcites →https://doi.org/10.21236/ada087640openalex-snapshot
Canonical Forms and Unification.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.1994.1002openalex-snapshot
Completeness of Combinations of Conditional Constructor Systems
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-55844-6_153openalex-snapshot
Analyses of inconsistency for incremental equational logic programming
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_6openalex-snapshot
Completeness of combinations of conditional constructor systems
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_14openalex-snapshot
On the completeness of narrowing as the operational semantics of functional logic programming
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_93openalex-snapshot
Narrowing approximations as an optimization for equational logic programs
inferred← citeshttps://doi.org/10.1007/3-540-59340-3_14openalex-snapshot
Affine geometry of collinearity and conditional term rewriting
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_175openalex-snapshot
A semantic matching algorithm: Analysis and implementation
inferred← citeshttps://doi.org/10.1007/978-3-031-31476-6_2openalex-snapshot
Optimizing Maude Programs via Program Specialization
inferred← citeshttps://doi.org/10.1007/978-3-032-07021-0_7openalex-snapshot
Graded Quantitative Narrowing
inferred← citeshttps://doi.org/10.1007/978-3-642-32943-2_7openalex-snapshot
Using Semantics Specified in Maude to Generate Test Cases
inferred← citeshttps://doi.org/10.1007/978-3-642-34005-5_11openalex-snapshot
Using Narrowing to Test Maude Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1007/bfb0014425openalex-snapshot
On the operational semantics of the algebraic and logic programming language LPG
inferred← citeshttps://doi.org/10.1007/bfb0016859openalex-snapshot
Higher order conditional rewriting and narrowing
inferred← citeshttps://doi.org/10.1007/bfb0033833openalex-snapshot
Narrowing the narrowing space
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.2010.07.009openalex-snapshot
An integrated framework for the diagnosis and correction of rule-based programs
inferred← citeshttps://doi.org/10.1109/iccl.1994.288383openalex-snapshot
A compositional semantics for conditional term rewriting systems
inferred← citeshttps://doi.org/10.1109/lics.1994.316040openalex-snapshot
Higher-order narrowing
inferred← citeshttps://doi.org/10.1145/174675.177889openalex-snapshot
Higher-order equational logic programming
inferred← citeshttps://doi.org/10.3115/991250.991283openalex-snapshot
Achieving flexibility in unification formalisms
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.