On the public citation graph

ORBIT: A parallel computing model of Prolog

https://doi.org/10.1007/bf03037061
0 signed · 19 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.1145/800046.801673openalex-snapshot
A parallel execution model of logic programs
inferredcites →https://doi.org/10.1145/800223.806775openalex-snapshot
Parallel interpretation of logic programs

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-18203-9_15openalex-snapshot
Computer architectures for artificial intelligence
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_98openalex-snapshot
Parallelism via speculation in pure Prolog
inferred← citeshttps://doi.org/10.1007/978-3-642-73451-9_17openalex-snapshot
An Or-Parallel Logic Programming Machine for Non-shared Memory Architectures
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_10openalex-snapshot
Parallelism and Logic Programming
inferred← citeshttps://doi.org/10.1007/bf01383953openalex-snapshot
Binding environments for parallel logic programs in non-shared memory multiprocessors
inferred← citeshttps://doi.org/10.1007/bf01397627openalex-snapshot
Full prolog and scheduling or-parallelism in muse
inferred← citeshttps://doi.org/10.1007/bf01414554openalex-snapshot
OR-parallel execution of Prolog on a multi-sequential machine
inferred← citeshttps://doi.org/10.1007/bf03037415openalex-snapshot
A method for efficiently executing horn clause programs using multiple processors
inferred← citeshttps://doi.org/10.1007/bf03037528openalex-snapshot
Performance of Muse on switch-based multiprocessor machines
inferred← citeshttps://doi.org/10.1016/0167-739x(93)90016-iopenalex-snapshot
Exploiting OR-parallelism in logic programs: A review
inferred← citeshttps://doi.org/10.1016/0167-8191(85)90004-3openalex-snapshot
Overview of parallel processing research in Japan
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/b978-0-444-81837-9.50016-6openalex-snapshot
A Model for Parallel Deduction
inferred← citeshttps://doi.org/10.1093/comjnl/30.5.386openalex-snapshot
Principles of the Delphi Parallel Inference Machine
inferred← citeshttps://doi.org/10.1109/71.265944openalex-snapshot
Machine independent AND and OR parallel execution of logic programs. I. The binding environment
inferred← citeshttps://doi.org/10.1109/ms.1985.231026openalex-snapshot
Special Feature A Qualitative Assessment of Parallelism in Expert Systems
inferred← citeshttps://doi.org/10.1145/15715.15718openalex-snapshot
Survey on special purpose computer architectures for AI
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.