On the public citation graph

And-Or parallel Prolog: A recomputation based approach

https://doi.org/10.1007/bf03037180
0 signed · 26 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/3-540-16492-8_63openalex-snapshot
Efficient management of backtracking in AND-Parallelism
inferredcites →https://doi.org/10.1007/3-540-54152-7_78openalex-snapshot
Virtual memory support for OR-parallel logic programming systems
inferredcites →https://doi.org/10.1007/3-540-55038-0_11openalex-snapshot
ACE: And/or-parallel copying-based execution of logic programs
inferredcites →https://doi.org/10.1007/3-540-55599-4_114openalex-snapshot
And-or parallelism in full Prolog with paged Binding Arrays
inferredcites →https://doi.org/10.1007/978-3-662-25209-3_51openalex-snapshot
Virtual Memory Support for OR-Parallel Logic Programming Systems
inferredcites →https://doi.org/10.1007/bf01397627openalex-snapshot
Full prolog and scheduling or-parallelism in muse
inferredcites →https://doi.org/10.1007/bf03037208openalex-snapshot
The Aurora or-parallel Prolog system
inferredcites →https://doi.org/10.1007/bf03037327openalex-snapshot
Efficient Prolog memory management for flexible control strategies
inferredcites →https://doi.org/10.1007/bf03037415openalex-snapshot
A method for efficiently executing horn clause programs using multiple processors
inferredcites →https://doi.org/10.1109/spdp.1992.242731openalex-snapshot
The Dharma scheduler-definitive scheduling in Aurora on multiprocessors architecture
inferredcites →https://doi.org/10.1145/109625.109635openalex-snapshot
Andorra I
inferredcites →https://doi.org/10.1145/109626.109635openalex-snapshot
Andorra I

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-48311-x_125openalex-snapshot
DAOS — Scalable And-Or Parallelism
inferred← citeshttps://doi.org/10.1007/bf03037372openalex-snapshot
PAN: A portable, parallel Prolog: Its design, realisation and performance
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/s0164-1212(98)10021-3openalex-snapshot
Exploiting and-or parallelism in Prolog: The OASys computational model and abstract architecture
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-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.1109/ipps.1999.760555openalex-snapshot
COWL: Copy-On-Write for logic programs
inferred← citeshttps://doi.org/10.1145/266670.266691openalex-snapshot
Extended dynamic dependent and-parallelism in ACE
inferred← citeshttps://doi.org/10.1145/504083.504085openalex-snapshot
Parallel execution of prolog programs
inferred← citeshttps://doi.org/10.20868/upm.thesis.21607openalex-snapshot
Independence, Global analysis, and parallelism, in dinamically scheduled constraint logic programming.
inferred← citeshttps://doi.org/10.5753/sbac-pad.1996.19823openalex-snapshot
Performance of Sparse Binding Arrays for Or-Parallelism
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.