On the public citation graph

Full prolog and scheduling or-parallelism in muse

https://doi.org/10.1007/bf01397627
0 signed · 50 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-16492-8_62openalex-snapshot
An abstract machine for restricted AND-parallel execution of logic programs
inferredcites →https://doi.org/10.1007/bf01383953openalex-snapshot
Binding environments for parallel logic programs in non-shared memory multiprocessors
inferredcites →https://doi.org/10.1007/bf01407834openalex-snapshot
The muse approach to Or-parallel prolog
inferredcites →https://doi.org/10.1007/bf03037061openalex-snapshot
ORBIT: A parallel computing model of Prolog
inferredcites →https://doi.org/10.1007/bf03037208openalex-snapshot
The Aurora or-parallel Prolog system
inferredcites →https://doi.org/10.1093/comjnl/30.5.386openalex-snapshot
Principles of the Delphi Parallel Inference Machine

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-48159-1_13openalex-snapshot
YapOr: An Or-Parallel Prolog System Based on Environment Copying
inferred← citeshttps://doi.org/10.1007/3-540-49201-1_10openalex-snapshot
Or-Parallelism within Tabling
inferred← citeshttps://doi.org/10.1007/3-540-55038-0_8openalex-snapshot
Performance of Muse on the BBN Butterfly TC2000
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_113openalex-snapshot
Performance of Muse on the BBN Butterfly TC2000
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_114openalex-snapshot
And-or parallelism in full Prolog with paged Binding Arrays
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_82openalex-snapshot
A novel method for parallel implementation of findall
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_18openalex-snapshot
Speculative Computations in Or-Parallel Tabled Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_98openalex-snapshot
A Methodology for Order-Sensitive Execution of Non-deterministic Languages on Beowulf Platforms
inferred← citeshttps://doi.org/10.1007/978-3-540-92995-6_8openalex-snapshot
High Level Thread-Based Competitive Or-Parallelism in Logtalk
inferred← citeshttps://doi.org/10.1007/978-3-642-17796-5_7openalex-snapshot
Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
inferred← citeshttps://doi.org/10.1007/bf01018695openalex-snapshot
An application of an OR-Parallel Prolog system to phylogenetic analysis
inferred← citeshttps://doi.org/10.1007/bf01379406openalex-snapshot
Scheduling speculative work in MUSE and performance results
inferred← citeshttps://doi.org/10.1007/bf01547894openalex-snapshot
Scheduling in or-parallel Prolog systems: Survey and open problems
inferred← citeshttps://doi.org/10.1007/bf03037180openalex-snapshot
And-Or parallel Prolog: A recomputation based approach
inferred← citeshttps://doi.org/10.1007/bf03037223openalex-snapshot
On the complexity of or-parallelism
inferred← citeshttps://doi.org/10.1007/bf03037528openalex-snapshot
Performance of Muse on switch-based multiprocessor machines
inferred← citeshttps://doi.org/10.1007/bfb0058027openalex-snapshot
On the complexity of parallel implementation of logic programs
inferred← citeshttps://doi.org/10.1007/s002360050002openalex-snapshot
How to calculate symmetries of Petri nets
inferred← citeshttps://doi.org/10.1016/0167-739x(94)90052-3openalex-snapshot
Optimal implementation of and-or parallel Prolog
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00092-5openalex-snapshot
Cuts and side-effects in and-or parallel Prolog
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)00079-9openalex-snapshot
Overview of DASWAM: Exploitation of dependent and-parallelism
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10022-5openalex-snapshot
Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
inferred← citeshttps://doi.org/10.1017/s1471068404002030openalex-snapshot
On applying or-parallelism and tabling to logic programs
inferred← citeshttps://doi.org/10.1017/s1471068410000190openalex-snapshot
Threads and or-parallelism unified
inferred← citeshttps://doi.org/10.1017/s1471068411000512openalex-snapshot
The YAP Prolog system
inferred← citeshttps://doi.org/10.1023/a:1007529200051openalex-snapshot
Parallel Logic Programming for Problem Solving
inferred← citeshttps://doi.org/10.1023/a:1018929805694openalex-snapshot
Parallel symbolic computation in ACE
inferred← citeshttps://doi.org/10.1093/logcom/exu026openalex-snapshot
Coalgebraic logic programming: from Semantics to Implementation
inferred← citeshttps://doi.org/10.1109/empdp.1994.592534openalex-snapshot
Wavefront Scheduling In Logflow
inferred← citeshttps://doi.org/10.1109/hpc.2000.846560openalex-snapshot
A task scheduling algorithm for parallel logic programming systems
inferred← citeshttps://doi.org/10.1109/icpads.1998.741166openalex-snapshot
Flat indexing: a compilation technique to enhance parallelism of logic programs
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.199openalex-snapshot
Scheduling OR-parallelism in YapOr and ThOr on Multi-Core Machines
inferred← citeshttps://doi.org/10.1109/isads.1995.398954openalex-snapshot
Exploiting the sources of parallelism in logic programs
inferred← citeshttps://doi.org/10.1109/spdp.1992.242732openalex-snapshot
Complete and efficient methods for supporting side-effects and cuts in And-Or parallel Prolog
inferred← citeshttps://doi.org/10.1145/2643135.2643150openalex-snapshot
Design and Implementation of a Multithreaded Virtual Machine for Executing Linear Logic Programs
inferred← citeshttps://doi.org/10.1145/504083.504085openalex-snapshot
Parallel execution of prolog programs
inferred← citeshttps://doi.org/10.1147/sj.314.0755openalex-snapshot
Prolog at IBM: An advanced and evolving application development technology
inferred← citeshttps://doi.org/10.2298/csis131025050sopenalex-snapshot
A team-based scheduling model for interfacing or-parallel prolog engines
inferred← citeshttps://doi.org/10.4230/oasics.slate.2013.9openalex-snapshot
Or-Parallel Prolog Execution on Clusters of Multicores
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3896openalex-snapshot
The YAP Prolog System
inferred← citeshttps://doi.org/10.48550/arxiv.1301.7690openalex-snapshot
On Comparing Alternative Splitting Strategies for Or-Parallel Prolog Execution on Multicores
inferred← citeshttps://doi.org/10.48550/arxiv.1312.6568openalex-snapshot
Coalgebraic Logic Programming: from Semantics to Implementation
inferred← citeshttps://doi.org/10.7551/mitpress/4316.003.0019openalex-snapshot
ACE: And/Or-parallel Copying-based Execution of Logic Programs
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.