On the public citation graph

Refined strategies for semantic unification

https://doi.org/10.1007/bfb0014986
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/978-0-387-34768-4_16openalex-snapshot
A Narrowing Procedure for Theories with Constructors
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/0743-1066(84)90004-9openalex-snapshot
Equality, types, modules, and (why not?) generics for logic programming
inferredcites →https://doi.org/10.1137/0204036openalex-snapshot
Proving Theorems with the Modification Method
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.1007/3-540-17943-7_140openalex-snapshot
A two-level approach to logic plus functional programming integration
inferred← citeshttps://doi.org/10.1007/3-540-19129-1_7openalex-snapshot
A completeness result for E-unification algorithms based on conditional narrowing
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_4openalex-snapshot
Solving goals in equational languages
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_40openalex-snapshot
A logic-functional approach to the execution of CCS specifications modulo behavioural equivalences
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_54openalex-snapshot
Functional extensions to prolog: Are they needed?
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_59openalex-snapshot
Integrating logic programming and equational specification of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_60openalex-snapshot
Narrowing with built-in theories
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_74openalex-snapshot
Babel: A functional and logic programming language based on constructor discipline and narrowing
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_99openalex-snapshot
Completion-time optimization of rewrite-time goal solving
inferred← citeshttps://doi.org/10.1007/3-540-51564-x_51openalex-snapshot
Completeness of extended unification based on basic narrowing
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_39openalex-snapshot
Combinatory forms for equational programming: Instances, unification and narrowing
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_112openalex-snapshot
Efficient integration of simplification into Prolog
inferred← citeshttps://doi.org/10.1007/3-540-55124-7_8openalex-snapshot
Complete equational unification based on an extension of the Knuth-Bendix completion procedure
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-46620-5_13openalex-snapshot
On The Integration of Equality, Sorts, and Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-88719-2_8openalex-snapshot
Prolog-Arbeiten in Karlsruhe
inferred← citeshttps://doi.org/10.1007/bfb0013543openalex-snapshot
Efficient implementation of narrowing and rewriting
inferred← citeshttps://doi.org/10.1007/bfb0013830openalex-snapshot
Counterexamples to completeness results for basic narrowing (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0013831openalex-snapshot
Uniform narrowing strategies
inferred← citeshttps://doi.org/10.1007/bfb0024197openalex-snapshot
Compiling logic programs with equality
inferred← citeshttps://doi.org/10.1007/bfb0026098openalex-snapshot
On completeness of narrowing strategies
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90009-topenalex-snapshot
Kernel-LEAF: A logic plus functional language
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90095-3openalex-snapshot
Narrowing vs. SLD-resolution
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90032-dopenalex-snapshot
On completeness of narrowing strategies
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(90)90064-oopenalex-snapshot
A rationale for conditional equational programming
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90170-xopenalex-snapshot
C-expressions: a variable-free calculus for equational logic programming
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(91)90010-mopenalex-snapshot
Comments on “logic programming with equations”
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50014-6openalex-snapshot
Lazy Unification Algorithms for Canonical Rewrite Systems
inferred← citeshttps://doi.org/10.1016/j.fss.2008.11.028openalex-snapshot
A hybrid programming scheme combining fuzzy-logic and functional-logic resources
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80014-8openalex-snapshot
Basic narrowing revisited
inferred← citeshttps://doi.org/10.1109/icse.1990.63618openalex-snapshot
System support for modular order-sorted Horn clause specifications
inferred← citeshttps://doi.org/10.20868/upm.thesis.1252openalex-snapshot
Diseño, semántica y especificación de Babel : un lenguaje que integra la programación funcional y lógica
inferred← citeshttps://doi.org/10.5555/100296.100318openalex-snapshot
System support for modular order-sorted horn clause specifications
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.