On the public citation graph

The muse approach to Or-parallel prolog

0 signed · 75 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-16479-0_17openalex-snapshot

Guarded horn clauses

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/3-540-51285-3_38openalex-snapshot

Pruning and scheduling speculative work in or-parallel Prolog

inferredcites →https://doi.org/10.1007/bf00128177openalex-snapshot

OR parallel execution of Prolog programs with side effects

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/bf01414554openalex-snapshot

OR-parallel execution of Prolog on a multi-sequential machine

inferredcites →https://doi.org/10.1007/bf02575007openalex-snapshot

Using automated reasoning tools: A study of the semigroupF 2 B 2

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

inferredcites →https://doi.org/10.1145/62959.62968openalex-snapshot

Garbarge collection for Prolog based on WAM

inferredcites →https://doi.org/10.5860/choice.29-2759openalex-snapshot

Parallel logic programming

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-44520-x_102openalex-snapshot

Novel Models for Or-Parallel Logic Programs: A Performance Analysis

inferred← citeshttps://doi.org/10.1007/3-540-45587-6_19openalex-snapshot

Segment Order Preserving and Generational Garbage Collection for Prolog

inferred← citeshttps://doi.org/10.1007/3-540-45635-x_11openalex-snapshot

On a Tabling Engine That Can Exploit Or-Parallelism

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_8openalex-snapshot

CHAT: The Copy-Hybrid Approach to Tabling

inferred← citeshttps://doi.org/10.1007/3-540-54152-7_79openalex-snapshot

Interfacing engines and schedulers in Or-Parallel Prolog systems

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-55460-2_14openalex-snapshot

Or-parallel Prolog with heuristic task distribution

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-55895-0_475openalex-snapshot

A time-bounded binding access with low task-switching cost in an OR-parallel prolog

inferred← citeshttps://doi.org/10.1007/3-540-56891-3_23openalex-snapshot

Why and how in the ElipSys OR-parallel CLP system

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/3-540-58430-7_26openalex-snapshot

On logic program parallelisation strategies

inferred← citeshttps://doi.org/10.1007/978-3-540-24580-3_21openalex-snapshot

YapDss: An Or-Parallel Prolog System for Scalable Beowulf Clusters

inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_87openalex-snapshot

Concurrent Table Accesses in Parallel Tabled Logic Programs

inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_63openalex-snapshot

Thread-Based Competitive Or-Parallelism

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-02846-5_19openalex-snapshot

A Tabling Implementation Based on Variables with Multiple Bindings

inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_52openalex-snapshot

Interfacing Engines and Schedulers in Or-Parallel Prolog Systems

inferred← citeshttps://doi.org/10.1007/bf01379406openalex-snapshot

Scheduling speculative work in MUSE and performance results

inferred← citeshttps://doi.org/10.1007/bf01397627openalex-snapshot

Full prolog and scheduling or-parallelism in muse

inferred← citeshttps://doi.org/10.1007/bf03037528openalex-snapshot

Performance of Muse on switch-based multiprocessor machines

inferred← citeshttps://doi.org/10.1007/bfb0033850openalex-snapshot

Selective recomputation for handling side-effects in parallel logic programs

inferred← citeshttps://doi.org/10.1007/bfb0056605openalex-snapshot

CAT: The Copying Approach to Tabling

inferred← citeshttps://doi.org/10.1016/0165-6074(92)90399-ropenalex-snapshot

An abstract prolog machine based on parallel resolution principle

inferred← citeshttps://doi.org/10.1016/0167-739x(92)90072-jopenalex-snapshot

Structural operational semantics for AKL

inferred← citeshttps://doi.org/10.1016/0167-8191(92)90070-nopenalex-snapshot

A parallel Prolog resolution based on multiple unifications

inferred← citeshttps://doi.org/10.1016/b978-0-444-81837-9.50016-6openalex-snapshot

A Model for Parallel Deduction

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/s0096-0551(96)00013-6openalex-snapshot

Assembling a resolution multiprocessor from interface, programming and distributed processing components

inferred← citeshttps://doi.org/10.1016/s0167-739x(97)00025-3openalex-snapshot

Parallel execution of Prolog with granularity control

inferred← citeshttps://doi.org/10.1016/s0167-739x(99)00083-7openalex-snapshot

Handling side-effects and cuts with selective recomputation in parallel Prolog

inferred← citeshttps://doi.org/10.1016/s0167-739x(99)00092-8openalex-snapshot

CHAT: the copy-hybrid approach to tabling

inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00108-2openalex-snapshot

OASys: An AND/OR parallel logic programming system

inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00117-3openalex-snapshot

A parallel prolog system for distributed memory

inferred← citeshttps://doi.org/10.1017/s1471068404002030openalex-snapshot

On applying or-parallelism and tabling to logic programs

inferred← citeshttps://doi.org/10.1017/s1471068406002985openalex-snapshot

PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters

inferred← citeshttps://doi.org/10.1017/s1471068410000190openalex-snapshot

Threads and or-parallelism unified

inferred← citeshttps://doi.org/10.1017/s1471068411000482openalex-snapshot

SICStus Prolog—The first 25 years

inferred← citeshttps://doi.org/10.1017/s1471068416000296openalex-snapshot

On the Implementation of an Or-Parallel Prolog System for Clusters of Multicores

inferred← citeshttps://doi.org/10.1017/s147106841800039xopenalex-snapshot

Table space designs for implicit and explicit concurrent tabled evaluation

inferred← citeshttps://doi.org/10.1017/s1471068422000059openalex-snapshot

Parallel Logic Programming: A Sequel

inferred← citeshttps://doi.org/10.1017/s1471068422000102openalex-snapshot

Fifty Years of Prolog and Beyond

inferred← citeshttps://doi.org/10.1109/12.312115openalex-snapshot

A highly OR-parallel inference machine (Multi-ASCA) and its performance evaluation: an architecture and its load balancing algorithms

inferred← citeshttps://doi.org/10.1109/icdcs.1998.679506openalex-snapshot

Granularity control for distributed execution of logic programs

inferred← citeshttps://doi.org/10.1109/icips.1997.669163openalex-snapshot

Parallel logic programming on distributed shared memory system

inferred← citeshttps://doi.org/10.1109/icips.1997.669198openalex-snapshot

Development of a new type of machining robot-a new type of driving mechanism

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/icpp.1999.797418openalex-snapshot

Efficient techniques for distributed implementation of search-based AI systems

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.1145/2103736.2103738openalex-snapshot

Or-parallel prolog execution on multicores based on stack splitting

inferred← citeshttps://doi.org/10.1145/286860.286871openalex-snapshot

Memory management for Prolog with tabling

inferred← citeshttps://doi.org/10.1145/301589.286871openalex-snapshot

Memory management for Prolog with tabling

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.20868/upm.thesis.14660openalex-snapshot

Estrategias Avanzadas de Tabulación y Paralelismo en Programas Lógicos = Advanced Evaluation Strategies for Tabling and Parallelism in Logic Programs

inferred← citeshttps://doi.org/10.22456/2175-2745.59614openalex-snapshot

Paralelismo em Prolog: Conceitos e Sistemas

inferred← citeshttps://doi.org/10.2298/csis131025050sopenalex-snapshot

A team-based scheduling model for interfacing or-parallel prolog engines

inferred← citeshttps://doi.org/10.34626/51mc-me97openalex-snapshot

High-Level Constructors for Solution Searching in Or-Parallel Prolog Systems

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.1112.3786openalex-snapshot

High-Level Multi-Threading in hProlog

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.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.