On the public citation graph

On parallel unification for Prolog

https://doi.org/10.1007/bf03037466
0 signed · 18 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/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf03037057openalex-snapshot
Efficient unification over infinite terms
inferredcites →https://doi.org/10.1007/bf03037439openalex-snapshot
Maximal unifiable subsets and minimal nonunifiable subsets
inferredcites →https://doi.org/10.1016/0022-0000(78)90043-0openalex-snapshot
Linear unification
inferredcites →https://doi.org/10.1109/tc.1986.1676783openalex-snapshot
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/357162.357168openalex-snapshot
High-Level Language Implications of the Proposed IEEE Floating-Point Standard
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm

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-55425-4_1openalex-snapshot
Potentiality of parallelism in logic
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_13openalex-snapshot
Non-WAM models of logic programming and their support by novel parallel hardware
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_3openalex-snapshot
Parallel unification: Theory and implementations
inferred← citeshttps://doi.org/10.1007/978-3-7091-7533-0_32openalex-snapshot
Connectionist Unifying Prolog
inferred← citeshttps://doi.org/10.1007/978-94-011-2562-8_13openalex-snapshot
The Wivenhoe Computational Model: In Search of More Parallelisms
inferred← citeshttps://doi.org/10.1016/b978-0-444-81704-4.50015-6openalex-snapshot
Parallel Automated Theorem Proving
inferred← citeshttps://doi.org/10.1017/s0269888900004720openalex-snapshot
Computer architectures for logic-oriented data/knowledge bases
inferred← citeshttps://doi.org/10.1080/02533839.1994.9677586openalex-snapshot
Unification without occurs check on a cellular tree
inferred← citeshttps://doi.org/10.1109/tai.1989.65384openalex-snapshot
Improved control strategy for parallel logic programming
inferred← citeshttps://doi.org/10.1145/62029.62030openalex-snapshot
Unification: a multidisciplinary survey
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.