On the public citation graph

On completeness of narrowing strategies

https://doi.org/10.1007/bfb0026098
0 signed · 41 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-16442-1_26openalex-snapshot
Experiences with the RAP system — a specification interpreter combining term rewriting and resolution
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-17220-3_20openalex-snapshot
Improving basic narrowing techniques
inferredcites →https://doi.org/10.1007/3-540-17220-3_21openalex-snapshot
Strategy-controlled reduction and narrowing
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bfb0014986openalex-snapshot
Refined strategies for semantic unification
inferredcites →https://doi.org/10.1016/0304-3975(84)90087-2openalex-snapshot
Conditional rewrite rules
inferredcites →https://doi.org/10.1016/0743-1066(84)90004-9openalex-snapshot
Equality, types, modules, and (why not?) generics for logic programming
inferredcites →https://doi.org/10.1016/0743-1066(86)90014-2openalex-snapshot
The relation between logic and functional languages: a survey
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.1109/sfcs.1980.37openalex-snapshot
Proofs by induction in equational theories with constructors
inferredcites →https://doi.org/10.1145/321850.321859openalex-snapshot
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming

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-53162-9_47openalex-snapshot
Lazy narrowing in a graph machine
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_39openalex-snapshot
An optimal narrowing strategy for general canonical systems
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_18openalex-snapshot
Implementation of a universal unification algorithm for macro tree transducers
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_26openalex-snapshot
Combining lazy narrowing and simplification
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_71openalex-snapshot
Regular substitution sets: A means of controlling E-unification
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_55openalex-snapshot
Implementation of a UU-algorithm for primitive recursive tree functions
inferred← citeshttps://doi.org/10.1007/3540539816_79openalex-snapshot
On narrowing strategies for partial non-strict functions
inferred← citeshttps://doi.org/10.1007/978-1-4471-3794-8_12openalex-snapshot
A survey of the implementations of narrowing
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_13openalex-snapshot
Transformation and Debugging of Functional Logic Programs
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/bfb0026814openalex-snapshot
A verified implementation of narrowing
inferred← citeshttps://doi.org/10.1007/bfb0033833openalex-snapshot
Narrowing the narrowing space
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90063-nopenalex-snapshot
Conditional equational theories and complete sets of transformations
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00224-7openalex-snapshot
Incremental constraint satisfaction for equational logic programming
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.1017/s0956796897002645openalex-snapshot
Leftmost outside-in narrowing calculi
inferred← citeshttps://doi.org/10.1093/logcom/13.2.287openalex-snapshot
Uniform Lazy Narrowing
inferred← citeshttps://doi.org/10.1145/291891.291896openalex-snapshot
Partial evaluation of functional logic programs
inferred← citeshttps://doi.org/10.3233/fi-1995-24126openalex-snapshot
NARROWING STRATEGIES FOR ARBITRARY CANONICAL REWRITE SYSTEMS
inferred← citeshttps://doi.org/10.4995/thesis/10251/55796openalex-snapshot
Análisis semántico y transformación de programas lógico-funcionales.
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).
inferred← citeshttps://doi.org/10.7551/mitpress/4298.003.0065openalex-snapshot
On Extra Variables in (Equational) Logic 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.