On the public citation graph
Extensions of Logic Programming
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.
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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpa.3160480908openalex-snapshot
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
inferred← citeshttps://doi.org/10.1006/jsco.1999.0346openalex-snapshot
Program Development Schemata as Derived Rules
inferred← citeshttps://doi.org/10.1006/jsco.2000.0465openalex-snapshot
Automatic Derivation of the Irrationality of e
inferred← citeshttps://doi.org/10.1007/10722280_37openalex-snapshot
From PROLOG++ to PROLOG+CG: A CG Object-Oriented Logic Programming Language
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_57openalex-snapshot
Axioms in definitional calculi
inferred← citeshttps://doi.org/10.1007/978-3-031-50981-0openalex-snapshot
Peter Schroeder-Heister on Proof-Theoretic Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_6openalex-snapshot
A Deductive Approach to Logic Programming
inferred← citeshttps://doi.org/10.1007/978-94-009-1675-3_4openalex-snapshot
Middle-Out Reasoning for Synthesis and Induction
inferred← citeshttps://doi.org/10.1007/978-94-011-4231-1_7openalex-snapshot
How to Glue a Donkey to an F-Structure: Porting a ‘Dynamic’ Meaning Representation Language into LFG’s Linear Logic Glue-Language Semantics
inferred← citeshttps://doi.org/10.1007/bfb0014004openalex-snapshot
An overview of temporal and modal logic programming
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90240-topenalex-snapshot
A theory of binding structures and applications to rewriting
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00268-9openalex-snapshot
Intensional aspects of function definitions
inferred← citeshttps://doi.org/10.1016/b978-044451541-4/50025-7openalex-snapshot
Logically Possible Worlds and Counterpart Semantics for Modal Logic
inferred← citeshttps://doi.org/10.1016/b978-1-55860-247-2.50025-5openalex-snapshot
Towards Inductive Generalisation in Higher Order Logic
inferred← citeshttps://doi.org/10.1016/j.apal.2013.05.008openalex-snapshot
A game semantics for disjunctive logic programming
inferred← citeshttps://doi.org/10.1016/j.ic.2010.03.002openalex-snapshot
Abstract deduction and inferential models for type theory
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00049-5openalex-snapshot
Definability and commonsense reasoning
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80024-4openalex-snapshot
A Proof-Theoretic Framework for Logic Programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00487-5openalex-snapshot
On primitive recursive algorithms and the greatest common divisor function
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.