On the public citation graph

The programming language GCLA — A definitional approach to logic programming

https://doi.org/10.1007/bf03037453
0 signed · 30 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/3-540-16492-8_94openalex-snapshot
Higher-order logic programming
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/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf01995106openalex-snapshot
Partial inductive definitions as type-systems for λ-terms
inferredcites →https://doi.org/10.1007/bf03037052openalex-snapshot
Foundation of logic programming based on inductive definition
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.1515/zwf-1986-811227openalex-snapshot
Building Expert 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/3-540-45587-6_6openalex-snapshot
Declarative Programming and Clinical Medicine On the Use of Gisela in the MedView Project
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_19openalex-snapshot
Implementational issues in GCLA: A-sufficiency and the definiens operation
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_53openalex-snapshot
Programming methodologies in GCLA
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_57openalex-snapshot
Axioms in definitional calculi
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_59openalex-snapshot
Regular search spaces as a foundation of logic programming
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_65openalex-snapshot
Definitional reflection and the completion
inferred← citeshttps://doi.org/10.1007/bfb0013546openalex-snapshot
The GCLA II programming language
inferred← citeshttps://doi.org/10.1007/bfb0013602openalex-snapshot
Methodology and programming techniques in GCLA II
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/bfb0013611openalex-snapshot
GCLA II A definitional approach to control
inferred← citeshttps://doi.org/10.1007/bfb0031929openalex-snapshot
Cut-elimination in logics with definitional reflection
inferred← citeshttps://doi.org/10.1007/bfb0038692openalex-snapshot
A survey of GCLA: A definitional approach to logic programming
inferred← citeshttps://doi.org/10.1007/bfb0038699openalex-snapshot
Logic programming, functional programming, and inductive definitions
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.1016/s0304-3975(01)00168-2openalex-snapshot
Encoding transition systems in sequent calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80412-8openalex-snapshot
Encoding Transition Systems in Sequent Calculus: Preliminary Report
inferred← citeshttps://doi.org/10.1093/logcom/1.5.635openalex-snapshot
A Proof-Theoretic Approach to Logic Programming
inferred← citeshttps://doi.org/10.1093/logcom/exw013openalex-snapshot
Logics with definitional reflection rules
inferred← citeshttps://doi.org/10.1109/lics.1993.287585openalex-snapshot
Rules of definitional reflection
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.