On the public citation graph

Efficient Prolog memory management for flexible control strategies

0 signed · 56 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.3115/981311.981338openalex-snapshot

Parsing as deduction

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-36575-3_6openalex-snapshot

Approximate Pruning in Tabled Logic Programming

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

Suspending and Resuming Computations in Engines for SLG Evaluation

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

CHAT Is Θ (SLG-WAM)

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

Virtual memory support for OR-parallel logic programming systems

inferred← citeshttps://doi.org/10.1007/3-540-54444-5_90openalex-snapshot

An architectural model for OR-parallellism on distributed memory systems

inferred← citeshttps://doi.org/10.1007/3-540-55038-0_2openalex-snapshot

Constraint handling, garbage collection and execution model issues in ElipSys

inferred← citeshttps://doi.org/10.1007/3-540-55038-0_5openalex-snapshot

καππα: A Kernel Andorra Prolog

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-55844-6_126openalex-snapshot

Binding techniques and garbage collection for OR-parallel CLP systems

inferred← citeshttps://doi.org/10.1007/3-540-57186-8_83openalex-snapshot

A parallel implementation for AKL

inferred← citeshttps://doi.org/10.1007/3-540-61626-8_91openalex-snapshot

Multiple OR-parallel resolution: Meta-level control of parallel logic programs

inferred← citeshttps://doi.org/10.1007/978-1-4612-3390-9_5openalex-snapshot

Parallel Problem Solving

inferred← citeshttps://doi.org/10.1007/978-1-4615-2690-2_13openalex-snapshot

Divided We Stand: Parallel Distributed Stack Memory Management

inferred← citeshttps://doi.org/10.1007/978-1-4615-2778-7_7openalex-snapshot

Integrating Dependent and-, Independent and-, and Or-parallelism

inferred← citeshttps://doi.org/10.1007/978-1-4615-3752-6_15openalex-snapshot

A Prolog Abstract Machine for Content-Addressable Memory

inferred← citeshttps://doi.org/10.1007/978-3-540-24836-1_9openalex-snapshot

Pruning in the Extended Andorra Model

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-642-58066-6_12openalex-snapshot

Logic Program Execution on Distributed Memory Parallel Computers

inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_5openalex-snapshot

Implementation Issues of Logic Programming Languages

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

OR parallel execution of Prolog programs with side effects

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

An overview of automated reasoning and related fields

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

A join algorithm for combining AND parallel solutions in AND/OR parallel systems

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

Or-parallel execution models of Prolog

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

Dynamic memory management for sequential logic programming languages

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

CAT: The Copying Approach to Tabling

inferred← citeshttps://doi.org/10.1016/0167-739x(88)90020-9openalex-snapshot

BRAVE—a parallel logic language for artificial intelligence

inferred← citeshttps://doi.org/10.1016/0167-739x(93)90016-iopenalex-snapshot

Exploiting OR-parallelism in logic programs: A review

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(84)90024-4openalex-snapshot

A KWIC (key word in context) bibliography on prolog and logic programming

inferred← citeshttps://doi.org/10.1016/0743-1066(84)90026-8openalex-snapshot

Associative concurrent evaluation of logic programs

inferred← citeshttps://doi.org/10.1016/0743-1066(89)90012-5openalex-snapshot

Or-parallel PROLOG on shared memory multiprocessors

inferred← citeshttps://doi.org/10.1016/0743-1066(93)90009-6openalex-snapshot

And—or parallelism on shared-memory multiprocessors

inferred← citeshttps://doi.org/10.1016/b978-0-934613-32-3.50025-3openalex-snapshot

TOWARD A TENSE-LOGIC-BASED MITIGATION OF THE FRAME PROBLEM

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-8191(98)00108-2openalex-snapshot

OASys: An AND/OR parallel logic programming system

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

On applying or-parallelism and tabling to logic programs

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

Parallel Logic Programming: A Sequel

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

Machine independent AND and OR parallel execution of logic programs. I. The binding environment

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

A systematic approach to exploiting implicit parallelism in Prolog

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

Design and performance measurements of an execution model for the parallel processing of Prolog programs

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

Reducing time by avoiding process serialisations in or-parallel interpretation of logic programs

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

Analysis of Or-parallel execution models

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

Layer sharing

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

Memory management for Prolog with tabling

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

An abstract machine for tabled execution of fixed-order stratified logic programs

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

A message driven OR-parallel machine

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

Strategies for deductive databases

inferred← citeshttps://doi.org/10.20868/upm.thesis.14975openalex-snapshot

An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel.

inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot

Assertion level proof planning with compiled strategies

inferred← citeshttps://doi.org/10.48550/arxiv.2104.01667openalex-snapshot

A Logical Programming Language as an Instrument for Specifying and Verifying Dynamic Memory

inferred← citeshttps://doi.org/10.5821/dissertation-2117-93325openalex-snapshot

Multipath: un sistema para la programación lógica

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.