On the public citation graph

A method for efficiently executing horn clause programs using multiple processors

https://doi.org/10.1007/bf03037415
0 signed · 45 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-55481-0openalex-snapshot
Programming in Prolog
inferredcites →https://doi.org/10.1007/bf03037051openalex-snapshot
Highly parallel inference engine PIE —Goal rewriting model and machine architecture—
inferredcites →https://doi.org/10.1007/bf03037061openalex-snapshot
ORBIT: A parallel computing model of Prolog
inferredcites →https://doi.org/10.1007/bf03037069openalex-snapshot
Architecture of a Reduction-Based Parallel Inference Machine: PIM-R
inferredcites →https://doi.org/10.1007/bf03037115openalex-snapshot
AND parallelism and nondeterminism in logic programs
inferredcites →https://doi.org/10.1007/bf03037380openalex-snapshot
A data-driven machine for OR-parallel evaluation of logic programs
inferredcites →https://doi.org/10.1007/bfb0014984openalex-snapshot
Or-parallel execution models of Prolog
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0743-1066(84)90022-0openalex-snapshot
On the sequential nature of unification
inferredcites →https://doi.org/10.1049/sm.1983.0024openalex-snapshot
Novel architectures for declarative languages
inferredcites →https://doi.org/10.1049/sm:19830024openalex-snapshot
Novel architectures for declarative languages
inferredcites →https://doi.org/10.1109/tc.1983.1676280openalex-snapshot
Divide-and-Conquer for Parallel Processing
inferredcites →https://doi.org/10.1109/tc.1985.6312194openalex-snapshot
A comparative study of unification algorithms for OR-parallel execution of logic languages
inferredcites →https://doi.org/10.1145/5001.5390openalex-snapshot
PARLOG: parallel programming in logic
inferredcites →https://doi.org/10.1145/773453.808197openalex-snapshot
Execution of logic programs on a dataflow architecture
inferredcites →https://doi.org/10.1145/800015.808197openalex-snapshot
Execution of logic programs on a dataflow architecture

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11564751_33openalex-snapshot
Parallel Local Search in Comet
inferred← citeshttps://doi.org/10.1007/3-540-45945-6openalex-snapshot
Programming Constraint Services: High-Level Programming of Standard and New Constraint Services
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_98openalex-snapshot
Parallelism via speculation in pure Prolog
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_122openalex-snapshot
OR-parallel Prolog on distributed memory systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3421-3_11openalex-snapshot
The DelPhi Multiprocessor Inference Machine
inferred← citeshttps://doi.org/10.1007/bf01408021openalex-snapshot
A distributed fair polling scheme applied to OR-parallel logic programming
inferred← citeshttps://doi.org/10.1007/bf02583023openalex-snapshot
High-level characteristics of or- and independent and-parallelism in prolog
inferred← citeshttps://doi.org/10.1007/bf03037165openalex-snapshot
Incremental search in Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/bf03037180openalex-snapshot
And-Or parallel Prolog: A recomputation based approach
inferred← citeshttps://doi.org/10.1016/0141-9331(90)90047-yopenalex-snapshot
IEEE futurebus cache coherence protocol as a logic program
inferred← citeshttps://doi.org/10.1016/0743-1066(89)90016-2openalex-snapshot
OR-parallel PROLOG in flat concurrent PROLOG
inferred← citeshttps://doi.org/10.1016/j.cl.2009.09.001openalex-snapshot
An investigation in parallel execution of answer set programs on distributed memory platforms: Task sharing and dynamic scheduling
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.05.002openalex-snapshot
Stack splitting: A technique for efficient exploitation of search parallelism on share-nothing platforms
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.07.006openalex-snapshot
On scalable parallel recursive backtracking
inferred← citeshttps://doi.org/10.1016/j.parco.2005.03.004openalex-snapshot
Issues in parallel execution of non-monotonic reasoning systems
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00082-8openalex-snapshot
Cuts and side-effects in distributed memory OR-parallel prolog
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00014-3openalex-snapshot
Parallel execution of logic programs by load sharing
inferred← citeshttps://doi.org/10.1016/s0923-0459(97)80008-0openalex-snapshot
Static partitioning with slackness
inferred← citeshttps://doi.org/10.1017/s1471068406002985openalex-snapshot
PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters
inferred← citeshttps://doi.org/10.1017/s1471068422000059openalex-snapshot
Parallel Logic Programming: A Sequel
inferred← citeshttps://doi.org/10.1023/a:1006127022180openalex-snapshot
SPS-Parallelism + SETHEO = SPTHEO
inferred← citeshttps://doi.org/10.1093/comjnl/30.5.386openalex-snapshot
Principles of the Delphi Parallel Inference Machine
inferred← citeshttps://doi.org/10.1109/ipdps.2001.924954openalex-snapshot
Experiments in parallel execution of answer set programs
inferred← citeshttps://doi.org/10.1145/155183.155220openalex-snapshot
Analysis of Or-parallel execution models
inferred← citeshttps://doi.org/10.1145/185403.185453openalex-snapshot
Parallel logic programming systems
inferred← citeshttps://doi.org/10.1145/504083.504085openalex-snapshot
Parallel execution of prolog programs
inferred← citeshttps://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming languages
inferred← citeshttps://doi.org/10.1145/976706.976714openalex-snapshot
A decomposition-based implementation of search strategies
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607040openalex-snapshot
PALS: Efficient Or-Parallelism on Beowulf Clusters
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.