On the public citation graph

A survey of GCLA: A definitional approach to logic programming

https://doi.org/10.1007/bfb0038692
0 signed · 22 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-16492-8_111openalex-snapshot
Negation and quantifiers in NU-Prolog
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf03037052openalex-snapshot
Foundation of logic programming based on inductive definition
inferredcites →https://doi.org/10.1007/bf03037077openalex-snapshot
Meta-level programming and knowledge representation
inferredcites →https://doi.org/10.1007/bf03037453openalex-snapshot
The programming language GCLA — A definitional approach to logic programming
inferredcites →https://doi.org/10.1016/0304-3975(91)90028-zopenalex-snapshot
Author index volume 86 (1991)
inferredcites →https://doi.org/10.1016/0743-1066(84)90029-3openalex-snapshot
N-Prolog: An extension of Prolog with hypothetical implications. I.
inferredcites →https://doi.org/10.1016/0743-1066(89)90031-9openalex-snapshot
A logical analysis of modules in logic programming
inferredcites →https://doi.org/10.1145/359131.359136openalex-snapshot
Algorithm = logic + control
inferredcites →https://doi.org/10.48456/tr-39openalex-snapshot
Tactics and tacticals in Cambridge LCF

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.1999.0346openalex-snapshot
Program Development Schemata as Derived Rules
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_53openalex-snapshot
Programming methodologies in GCLA
inferred← citeshttps://doi.org/10.1007/3-540-60688-2_52openalex-snapshot
Deriving and applying logic program transformers
inferred← citeshttps://doi.org/10.1007/bfb0013546openalex-snapshot
The GCLA II programming language
inferred← citeshttps://doi.org/10.1007/bfb0013605openalex-snapshot
A finitary version of the calculus of partial inductive definitions
inferred← citeshttps://doi.org/10.1007/bfb0013608openalex-snapshot
Logical and computational invariants of programs
inferred← citeshttps://doi.org/10.1007/bfb0013610openalex-snapshot
Terminological reasoning and partial inductive definitions
inferred← citeshttps://doi.org/10.1007/bfb0013611openalex-snapshot
GCLA II A definitional approach to control
inferred← citeshttps://doi.org/10.1007/bfb0038701openalex-snapshot
Hypothetical reasoning and definitional reflection in logic programming
inferred← citeshttps://doi.org/10.1016/s0096-0551(97)00014-3openalex-snapshot
Program separation and definitional higher order programming
inferred← citeshttps://doi.org/10.1093/logcom/1.5.635openalex-snapshot
A Proof-Theoretic Approach to Logic Programming
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.