On the public citation graph

Compile-time granularity analysis for parallel logic programming languages

https://doi.org/10.1007/bf03037210
0 signed · 29 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/bf03037208openalex-snapshot
The Aurora or-parallel Prolog system
inferredcites →https://doi.org/10.1145/93542.93564openalex-snapshot
Task granularity analysis in 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-55425-4_1openalex-snapshot
Potentiality of parallelism in logic
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-58601-6_95openalex-snapshot
Some methodological issues in the design of CIAO, a generic, parallel concurrent constraint logic programming system
inferred← citeshttps://doi.org/10.1007/978-1-4471-3794-8_20openalex-snapshot
Sequentializing Parallel Programs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3609-0_8openalex-snapshot
Parallelism in Logic Programming and Scheduling Issues
inferred← citeshttps://doi.org/10.1007/978-3-030-16657-1_62openalex-snapshot
A Single Program Multiple Data Algorithm for Feature Selection
inferred← citeshttps://doi.org/10.1007/bf02939495openalex-snapshot
Granularity analysis for exploiting adaptive parallelism of declarative programs on multiprocessors
inferred← citeshttps://doi.org/10.1007/bf03037179openalex-snapshot
A compile-time granularity analysis algorithm and its performance evaluation
inferred← citeshttps://doi.org/10.1007/bf03037372openalex-snapshot
PAN: A portable, parallel Prolog: Its design, realisation and performance
inferred← citeshttps://doi.org/10.1007/bfb0013541openalex-snapshot
Parallelizing Prolog on shared-memory multiprocessors
inferred← citeshttps://doi.org/10.1007/bfb0013835openalex-snapshot
Serialisation analysis of concurrent logic programs
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/s0743-1066(96)00117-3openalex-snapshot
A parallel prolog system for distributed memory
inferred← citeshttps://doi.org/10.1109/71.265945openalex-snapshot
Machine independent AND and OR parallel execution of logic programs. II. Compiled execution
inferred← citeshttps://doi.org/10.1109/icdcs.1998.679506openalex-snapshot
Granularity control for distributed execution of logic programs
inferred← citeshttps://doi.org/10.1145/165180.165209openalex-snapshot
Towards lazy evaluation, sharing, and non-determinism in resolution based functional logic languages
inferred← citeshttps://doi.org/10.1145/93542.93564openalex-snapshot
Task granularity analysis in logic programs
inferred← citeshttps://doi.org/10.1145/93548.93564openalex-snapshot
Task granularity analysis in logic programs
inferred← citeshttps://doi.org/10.1145/99163.99170openalex-snapshot
A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI
inferred← citeshttps://doi.org/10.20868/upm.thesis.474openalex-snapshot
Técnicas de transformación de programas lógicos para su optimización y paralelización automática
inferred← citeshttps://doi.org/10.22456/2175-2745.59614openalex-snapshot
Paralelismo em Prolog: Conceitos e Sistemas
inferred← citeshttps://doi.org/10.5753/sbac-pad.1995.19854openalex-snapshot
GRANLOG: Um Modelo para Análise Automática de Granulosidade na Programação em Lógica
inferred← citeshttps://doi.org/10.5753/sbac-pad.1995.19880openalex-snapshot
Performance Analysis of a Strategy to Distribute And-work and Or-work in Parallel Logic Programming Systems
inferred← citeshttps://doi.org/10.5753/sbac-pad.1999.19797openalex-snapshot
Using Compile-Time Granularity Information to Support Dynamic Work Distribution in Parallel Logic Programming Systems
inferred← citeshttps://doi.org/10.5753/sbac-pad.2000.41223openalex-snapshot
Distributed OR Scheduling with Granularity Information
inferred← citeshttps://doi.org/10.7551/mitpress/4283.003.0033openalex-snapshot
Lower-bound Time-complexity Analysis 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.