On the public citation graph

Grammar-related transformations of logic programs

0 signed · 17 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-08921-7_74openalex-snapshot
Goal-oriented derivation of logic programs
inferredcites →https://doi.org/10.1007/3540069585_47openalex-snapshot
LL(1) Grammars and Analysers
inferredcites →https://doi.org/10.1016/0743-1066(87)90010-0openalex-snapshot
Compiling associativity into logic programs
inferredcites →https://doi.org/10.1093/comjnl/11.1.31openalex-snapshot
A syntax improving program
inferredcites →https://doi.org/10.1145/322248.322258openalex-snapshot
Derivation of Logic Programs
inferredcites →https://doi.org/10.1145/355586.364826openalex-snapshot
Formal parsing systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10720327_12openalex-snapshot
Making Mercury Programs Tail Recursive
inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_13openalex-snapshot
Synthesis of Programs from Unfold/Fold Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-79980-1_26openalex-snapshot
Generating Specialized Rules and Programs for Demand-Driven Analysis
inferred← citeshttps://doi.org/10.1007/bf01211087openalex-snapshot
Running programs backwards: The logical inversion of imperative computation
inferred← citeshttps://doi.org/10.1016/0743-1066(87)90010-0openalex-snapshot
Compiling associativity into logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90028-0openalex-snapshot
Transformation of logic programs: Foundations and techniques
inferred← citeshttps://doi.org/10.1016/j.scico.2014.05.017openalex-snapshot
Program verification via iterated specialization
inferred← citeshttps://doi.org/10.1017/s0269888900008031openalex-snapshot
Developing correct and efficient logic programs by transformation
inferred← citeshttps://doi.org/10.1017/s1471068421000211openalex-snapshot
Analysis and Transformation of Constrained Horn Clauses for Program Verification
inferred← citeshttps://doi.org/10.1145/234528.234529openalex-snapshot
Rules and strategies for transforming functional and logic programs
inferred← citeshttps://doi.org/10.1145/2426890.2426899openalex-snapshot
Verifying programs via iterated specialization
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.