On the public citation graph

An experiment in domain refinement: Type domains and type representations for logic programs

https://doi.org/10.1007/bfb0056613
0 signed · 29 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-19426-6_13openalex-snapshot
Polymorphic type inference in Prolog by abstract interpretation
inferredcites →https://doi.org/10.1007/3-540-58485-4_46openalex-snapshot
Boolean functions for dependency analysis: Algebraic properties and efficient representation
inferredcites →https://doi.org/10.1007/3-540-58485-4_47openalex-snapshot
Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop
inferredcites →https://doi.org/10.1007/bf01213601openalex-snapshot
Reasoning about Prolog programs: From modes through types to assertions
inferredcites →https://doi.org/10.1007/bfb0032735openalex-snapshot
Logical optimality of groundness analysis
inferredcites →https://doi.org/10.1007/bfb0033844openalex-snapshot
Intuitionistic implication in abstract interpretation
inferredcites →https://doi.org/10.1016/0167-6423(92)90038-dopenalex-snapshot
A bottom-up polymorphic type inference in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(91)80002-uopenalex-snapshot
A type system for logic programs
inferredcites →https://doi.org/10.1016/0743-1066(92)90030-7openalex-snapshot
Abstract interpretation and application to logic programs
inferredcites →https://doi.org/10.1016/0743-1066(92)90032-xopenalex-snapshot
Deriving descriptions of possible values of program variables by means of abstract interpretation
inferredcites →https://doi.org/10.1016/0743-1066(95)00123-9openalex-snapshot
Optimal groundness analysis using propositional logic
inferredcites →https://doi.org/10.1016/s0304-3975(98)00122-4openalex-snapshot
Type dependencies for logic programs using ACI-unification
inferredcites →https://doi.org/10.1109/lics.1991.151654openalex-snapshot
Logic programs as types for logic programs
inferredcites →https://doi.org/10.1109/lics.1991.151655openalex-snapshot
A first-order theory of types and polymorphism in logic programming
inferredcites →https://doi.org/10.1145/234528.234742openalex-snapshot
A unifying view of abstract domain design
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0058openalex-snapshot
Fast and Precise Regular Approximations of Logic Programs

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-45499-3_14openalex-snapshot
Analysis of Downward Closed Properties of Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_40openalex-snapshot
Pos(T ): Analyzing Dependencies in Typed Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-48294-6_6openalex-snapshot
Freeness Analysis Through Linear Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_7openalex-snapshot
Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)00048-2openalex-snapshot
Pair-independence and freeness analysis through linear refinement
inferred← citeshttps://doi.org/10.1016/s1477-8424(03)00023-xopenalex-snapshot
Logic programs as compact denotations
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00112-4openalex-snapshot
Abstract Interpretation based Verification of Logic Programs
inferred← citeshttps://doi.org/10.1023/a:1025824903683openalex-snapshot
Path Dependent Analysis of Logic Programs
inferred← citeshttps://doi.org/10.1093/logcom/12.3.497openalex-snapshot
Generalizing Def and Pos to Type Analysis
inferred← citeshttps://doi.org/10.1145/351268.351293openalex-snapshot
A precise type analysis of logic programs
inferred← citeshttps://doi.org/10.1145/503032.503038openalex-snapshot
Path dependent analysis of logic programs
inferred← citeshttps://doi.org/10.1145/509799.503038openalex-snapshot
Path dependent analysis of logic programs
inferred← citeshttps://doi.org/10.5281/zenodo.41652openalex-snapshot
Blind Channel Identification In Speech Using The Long-Term Average Speech Spectrum
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.