On the public citation graph

Uniform narrowing strategies

https://doi.org/10.1007/bfb0013831
0 signed · 34 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-16442-1_9openalex-snapshot
Design and implementation of a generic, logic and functional programming language
inferredcites →https://doi.org/10.1007/3-540-16761-7_60openalex-snapshot
A Strong restriction of the inductive completion procedure
inferredcites →https://doi.org/10.1007/3-540-19488-6_153openalex-snapshot
Outer narrowing for equational theories based on constructors
inferredcites →https://doi.org/10.1007/3540539816_79openalex-snapshot
On narrowing strategies for partial non-strict functions
inferredcites →https://doi.org/10.1007/978-3-642-73824-1openalex-snapshot
Computing in Horn Clause Theories
inferredcites →https://doi.org/10.1007/bf00292110openalex-snapshot
On sufficient-completeness and related properties of term rewriting systems
inferredcites →https://doi.org/10.1007/bf01893885openalex-snapshot
Sufficient-completeness, ground-reducibility and their complexity
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.1016/0304-3975(86)90175-1openalex-snapshot
Complete sets of unifiers and matchers in equational theories
inferredcites →https://doi.org/10.1016/0304-3975(90)90032-dopenalex-snapshot
On completeness of narrowing strategies
inferredcites →https://doi.org/10.1016/0743-1066(87)90002-1openalex-snapshot
Extended unification algorithms for the integration of functional programming into logic programming
inferredcites →https://doi.org/10.1016/0743-1066(89)90028-9openalex-snapshot
Extending SLD resolution to equational horn clauses using E-unification
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/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1016/s0019-9958(85)80005-xopenalex-snapshot
Semantic confluence tests and completion methods
inferredcites →https://doi.org/10.1016/s0747-7171(89)80014-8openalex-snapshot
Basic narrowing revisited

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45406-3_5openalex-snapshot
Functional and Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_18openalex-snapshot
Lazy unification with simplification
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_10openalex-snapshot
On the connection between narrowing and proof by consistency
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_26openalex-snapshot
Combining lazy narrowing and simplification
inferred← citeshttps://doi.org/10.1007/978-3-030-16202-3openalex-snapshot
Functional and Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1007/bf01190830openalex-snapshot
Completeness results for basic narrowing
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/bfb0033833openalex-snapshot
Narrowing the narrowing space
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90034-5openalex-snapshot
The integration of functions into logic programming: From theory to practice
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.1016/s0096-0551(97)00010-6openalex-snapshot
Lazy narrowing with simplification
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00266-xopenalex-snapshot
Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424.
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80345-1openalex-snapshot
A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424.
inferred← citeshttps://doi.org/10.1093/logcom/13.2.287openalex-snapshot
Uniform Lazy Narrowing
inferred← citeshttps://doi.org/10.5281/zenodo.26359openalex-snapshot
Morphometrics As A Tool In Identification: A Case Study On A Myrmica From France (Hymenoptera, Formicidae).
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.