On the public citation graph

CAT: The Copying Approach to Tabling

https://doi.org/10.1007/bfb0056605
0 signed · 34 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/bf01407834openalex-snapshot
The muse approach to Or-parallel prolog
inferredcites →https://doi.org/10.1007/bf03037327openalex-snapshot
Efficient Prolog memory management for flexible control strategies
inferredcites →https://doi.org/10.1007/s100090050016openalex-snapshot
Semantics-based program analysis for logic-based languages using XSB
inferredcites →https://doi.org/10.1145/191839.191927openalex-snapshot
XSB as an efficient deductive database engine
inferredcites →https://doi.org/10.1145/191843.191927openalex-snapshot
XSB as an efficient deductive database engine
inferredcites →https://doi.org/10.1145/227595.227597openalex-snapshot
Tabled evaluation with delaying for general logic programs
inferredcites →https://doi.org/10.1145/286860.286871openalex-snapshot
Memory management for Prolog with tabling
inferredcites →https://doi.org/10.1145/291889.291897openalex-snapshot
An abstract machine for tabled execution of fixed-order stratified logic programs
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0067openalex-snapshot
Efficient Tabling Mechanisms for 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/11532231_5openalex-snapshot
Tabling for Higher-Order Logic Programming
inferred← citeshttps://doi.org/10.1007/11603023_11openalex-snapshot
Tabling in Mercury: Design and Implementation
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-45635-x_11openalex-snapshot
On a Tabling Engine That Can Exploit Or-Parallelism
inferred← citeshttps://doi.org/10.1007/3-540-46584-7_7openalex-snapshot
Heap Garbage Collection in XSB: Practice and Experience
inferred← citeshttps://doi.org/10.1007/3-540-46584-7_8openalex-snapshot
Implementation of a Linear Tabling Mechanism
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_21openalex-snapshot
CHAT Is Θ (SLG-WAM)
inferred← citeshttps://doi.org/10.1007/3-540-49201-1_10openalex-snapshot
Or-Parallelism within Tabling
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/978-3-540-77442-6_14openalex-snapshot
An Improved Continuation Call-Based Implementation of Tabling
inferred← citeshttps://doi.org/10.1007/978-3-540-92995-6_16openalex-snapshot
Towards a Complete Scheme for Tabled Execution Based on Program Transformation
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-11503-5_23openalex-snapshot
An Efficient Implementation of Linear Tabling Based on Dynamic Reordering of Alternatives
inferred← citeshttps://doi.org/10.1016/s0167-739x(99)00092-8openalex-snapshot
CHAT: the copy-hybrid approach to tabling
inferred← citeshttps://doi.org/10.1017/s147106840700316xopenalex-snapshot
Linear tabling strategies and optimizations
inferred← citeshttps://doi.org/10.1017/s1471068415000137openalex-snapshot
Tabling as a library with delimited control
inferred← citeshttps://doi.org/10.1017/s1471068419000383openalex-snapshot
Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015488openalex-snapshot
Achieving scalability in parallel tabled logic programs
inferred← citeshttps://doi.org/10.1145/286860.286871openalex-snapshot
Memory management for Prolog with tabling
inferred← citeshttps://doi.org/10.1145/888251.888277openalex-snapshot
Efficient fixpoint computation in linear tabling
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.20868/upm.thesis.58189openalex-snapshot
Advanced Evaluation Techniques for (Non)-Monotonic Reasoning Using Rules with Constraints
inferred← citeshttps://doi.org/10.34626/ckah-n545openalex-snapshot
On Applying Linear Tabling to Logic Programs
inferred← citeshttps://doi.org/10.4230/lipics.itp.2024.28openalex-snapshot
Lean Formalization of Completeness Proof for Coalition Logic with Common Knowledge
inferred← citeshttps://doi.org/10.48550/arxiv.1507.08087openalex-snapshot
Tabling as a Library with Delimited Control
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.