On the public citation graph

AID: An alternative implementation of DCGs

https://doi.org/10.1007/bf03037391
0 signed · 24 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/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf03037421openalex-snapshot
BUP: A Bottom-Up parser embedded in Prolog
inferredcites →https://doi.org/10.1007/bfb0031371openalex-snapshot
Metamorphosis grammars
inferredcites →https://doi.org/10.1016/0004-3702(80)90003-xopenalex-snapshot
Definite clause grammars for language analysis—A survey of the formalism and a comparison with augmented transition networks
inferredcites →https://doi.org/10.1016/0743-1066(85)90015-9openalex-snapshot
Relating logic programs and attribute grammars
inferredcites →https://doi.org/10.1016/s0019-9958(65)90426-2openalex-snapshot
On the translation of languages from left to right
inferredcites →https://doi.org/10.1145/359131.359136openalex-snapshot
Algorithm = logic + control

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-44957-4_88openalex-snapshot
A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language
inferred← citeshttps://doi.org/10.1007/3-540-48975-4_11openalex-snapshot
An Operational Model for Parsing De.nite Clause Grammars with In.nite Terms
inferred← citeshttps://doi.org/10.1007/3-540-50820-1_49openalex-snapshot
A semantic evaluator generating system in prolog
inferred← citeshttps://doi.org/10.1007/3-540-50820-1_50openalex-snapshot
A grammatical view of logic programming
inferred← citeshttps://doi.org/10.1007/3-540-53919-0_7openalex-snapshot
Parallel generalized LR parser based on logic programming
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_103openalex-snapshot
Profit: A system integrating logic programming and attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-54572-7_12openalex-snapshot
Attribute grammars and logic programs: A comparison of concepts
inferred← citeshttps://doi.org/10.1007/3-540-54572-7_16openalex-snapshot
Prototyping by using an attribute grammar as a logic program
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_74openalex-snapshot
A new top-down parsing algorithm for left-recursive DCGs
inferred← citeshttps://doi.org/10.1007/978-1-4615-4034-2_6openalex-snapshot
Parallel GLR Parsing Based on Logic Programming
inferred← citeshttps://doi.org/10.1007/978-94-010-9733-8_3openalex-snapshot
Increasing the Applicability of LR Parsing
inferred← citeshttps://doi.org/10.1016/0950-5849(95)90930-sopenalex-snapshot
Implementing Prolog Definite Clause Grammars with SLR(1) parsers on the Relational Algebra Accelerator
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00076-3openalex-snapshot
SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing
inferred← citeshttps://doi.org/10.1109/sccc.1998.730784openalex-snapshot
Dynamic programming as frame for efficient parsing
inferred← citeshttps://doi.org/10.3115/991886.991966openalex-snapshot
A modular architecture for constraint-based parsing
inferred← citeshttps://doi.org/10.3115/997939.997992openalex-snapshot
A new parallel algorithm for generalized LR parsing
inferred← citeshttps://doi.org/10.48550/arxiv.1405.3826openalex-snapshot
Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation 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.