On the public citation graph

Foundation of logic programming based on inductive definition

https://doi.org/10.1007/bf03037052
0 signed · 33 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-08138-0_19openalex-snapshot
A syntactic connection between proof procedures and refutation procedures
inferredcites →https://doi.org/10.1007/3-540-10009-1_22openalex-snapshot
Transforming matings into natural deduction proofs
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1016/0004-3702(80)90011-9openalex-snapshot
Circumscription—A form of non-monotonic reasoning
inferredcites →https://doi.org/10.1016/b978-0-12-161901-5.50023-6openalex-snapshot
INFORMATION PROCESSING
inferredcites →https://doi.org/10.1016/s0049-237x(08)70847-4openalex-snapshot
Hauptsatz for the Intuitionistic Theory of Iterated Inductive Definitions
inferredcites →https://doi.org/10.1016/s0049-237x(08)70849-8openalex-snapshot
Ideas and Results in Proof Theory
inferredcites →https://doi.org/10.1093/comjnl/23.1.61openalex-snapshot
Algorithm classification through synthesis
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming

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-16780-3_97openalex-snapshot
Formulation of induction formulas in verification of prolog programs
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_1openalex-snapshot
The Well-Founded Semantics Is the Principle of Inductive Definition
inferred← citeshttps://doi.org/10.1007/3-540-55460-2_37openalex-snapshot
Logic programming with bounded quantifiers
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_5openalex-snapshot
Foundational issues in implementing constraint logic programming systems
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_114openalex-snapshot
Inductive definitions and type theory an introduction (preliminary version)
inferred← citeshttps://doi.org/10.1007/3-540-60688-2_52openalex-snapshot
Deriving and applying logic program transformers
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_1openalex-snapshot
Semantics of constraint logic programs with bounded quantifiers
inferred← citeshttps://doi.org/10.1007/978-1-4471-3494-7_8openalex-snapshot
Formal validation of transformation schemata
inferred← citeshttps://doi.org/10.1007/978-3-540-31862-0_25openalex-snapshot
Random Generators for Dependent Types
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_15openalex-snapshot
A Deductive System for PC(ID)
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_13openalex-snapshot
A Deductive System for FO(ID) Based on Least Fixpoint Logic
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_2openalex-snapshot
Theoretical Issues of Logic Programming
inferred← citeshttps://doi.org/10.1007/bf01124982openalex-snapshot
Initial semantics of logic specifications with negation
inferred← citeshttps://doi.org/10.1007/bf01211308openalex-snapshot
Inductive families
inferred← citeshttps://doi.org/10.1007/bf03037453openalex-snapshot
The programming language GCLA — A definitional approach to logic programming
inferred← citeshttps://doi.org/10.1007/bfb0038691openalex-snapshot
Predicates as parameters in logic programming
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.1016/0167-6423(95)00011-9openalex-snapshot
Foundational issues in implementing constraint logic programming systems
inferred← citeshttps://doi.org/10.1016/0743-1066(86)90005-1openalex-snapshot
A constructive view of PROLOG
inferred← citeshttps://doi.org/10.1016/b978-0-934613-32-3.50012-5openalex-snapshot
A Note on Non-Monotonic Reasoning
inferred← citeshttps://doi.org/10.1016/s0747-7171(85)80040-7openalex-snapshot
A Selected Bibliography on Constructive Mathematics, Intuitionistic Type Theory and Higher Order Deduction
inferred← citeshttps://doi.org/10.1017/s1471068421000533openalex-snapshot
A Survey of the Proof-Theoretic Foundations of 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.