On the public citation graph

Simplifying dynamic programming via mode‐directed tabling

https://doi.org/10.1002/spe.824
0 signed · 28 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-63166-6_16openalex-snapshot
Efficient model checking using tabled resolution
inferredcites →https://doi.org/10.1007/978-3-031-26212-8_4openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-24754-8_4openalex-snapshot
Online Justification for Tabled Logic Programs
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1017/s1471068400001010openalex-snapshot
Linear tabulated resolution based on Prolog control strategy
inferredcites →https://doi.org/10.1023/a:1018990308362openalex-snapshot
Tabling for non‐monotonic programming
inferredcites →https://doi.org/10.1145/227595.227597openalex-snapshot
Tabled evaluation with delaying for general logic programs
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.1145/351268.351290openalex-snapshot
Justifying proofs using memo tables

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.4491openalex-snapshot
Multi‐dimensional lock‐free arrays for multithreaded mode‐directed tabling in Prolog
inferred← citeshttps://doi.org/10.1002/spe.2278openalex-snapshot
A dynamic stochastic model for automatic grammar‐based test generation
inferred← citeshttps://doi.org/10.1007/978-3-030-05998-9_7openalex-snapshot
Incremental Evaluation of Lattice-Based Aggregates in Logic Programming Using Modular TCLP
inferred← citeshttps://doi.org/10.1007/978-3-642-41707-8_2openalex-snapshot
Automatic Grammar-Based Test Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-45284-0_10openalex-snapshot
On the Efficient Implementation of Mode-Directed Tabling
inferred← citeshttps://doi.org/10.1007/978-3-642-45284-0_5openalex-snapshot
Supporting Pruning in Tabled LP
inferred← citeshttps://doi.org/10.1007/978-981-92-0184-6_14openalex-snapshot
Dynamic Programming and Tabled Logic Programming for Encoding Single-Constant Multiplication Into SAT (Declarative Pearls)
inferred← citeshttps://doi.org/10.1016/j.cl.2016.01.006openalex-snapshot
A semantic approach for automated test oracle generation
inferred← citeshttps://doi.org/10.1016/j.jss.2016.06.060openalex-snapshot
On scaling dynamic programming problems with a multithreaded tabling Prolog system
inferred← citeshttps://doi.org/10.1017/s1471068411000445openalex-snapshot
The language features and architecture of B-Prolog
inferred← citeshttps://doi.org/10.1017/s1471068412000129openalex-snapshot
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming
inferred← citeshttps://doi.org/10.1017/s1471068413000501openalex-snapshot
BigYAP: Exo-compilation meets UDI
inferred← citeshttps://doi.org/10.1017/s1471068415000137openalex-snapshot
Tabling as a library with delimited control
inferred← citeshttps://doi.org/10.1017/s1471068415000216openalex-snapshot
Planning as tabled logic programming
inferred← citeshttps://doi.org/10.1017/s147106841600048xopenalex-snapshot
Tabling with Sound Answer Subsumption
inferred← citeshttps://doi.org/10.1109/ictai.2010.103openalex-snapshot
Mode-Directed Tabling for Dynamic Programming, Machine Learning, and Constraint Solving
inferred← citeshttps://doi.org/10.1109/taai.2015.7407131openalex-snapshot
The effect of domain modeling on efficiency of planning: Lessons from the Nomystery domain
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
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.