On the public citation graph

Fixpoint semantics for partial computed answer substitutions and call patterns

https://doi.org/10.1007/bfb0013821
0 signed · 34 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.1006/inco.1995.1138openalex-snapshot
Observable Behaviors and Equivalences of Logic Programs
inferredcites →https://doi.org/10.1007/3-540-19129-1_4openalex-snapshot
Unification Revisited
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/bfb0032046openalex-snapshot
Algebraic properties of idempotent substitutions
inferredcites →https://doi.org/10.1016/0304-3975(89)90070-4openalex-snapshot
Declarative modeling of the operational behavior of logic languages
inferredcites →https://doi.org/10.1016/0304-3975(89)90088-1openalex-snapshot
Recursive query processing: the power of logic
inferredcites →https://doi.org/10.1016/0304-3975(90)90061-lopenalex-snapshot
Finite failures and partial computations in concurrent logic languages
inferredcites →https://doi.org/10.1016/0304-3975(94)90055-8openalex-snapshot
Bottom-up abstract interpretation of logic programs
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1016/s0747-7171(85)80027-4openalex-snapshot
Properties of substitutions and unifications
inferredcites →https://doi.org/10.1145/151646.151650openalex-snapshot
A general framework for semantics-based bottom-up abstract interpretation of logic programs
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot
Constraint 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/inco.1995.1146openalex-snapshot
Oracle Semantics for Prolog
inferred← citeshttps://doi.org/10.1006/inco.2000.3024openalex-snapshot
A Theory of Observables for Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_35openalex-snapshot
New semantic tools for logic programming
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_41openalex-snapshot
“Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_16openalex-snapshot
Complementing logic program semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-36668-3_132openalex-snapshot
Designing Prolog Semantics for a Class of Observables
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_2openalex-snapshot
Theoretical Foundations and Semantics of Logic Programming
inferred← citeshttps://doi.org/10.1007/bfb0013822openalex-snapshot
Oracle semantics for Prologa
inferred← citeshttps://doi.org/10.1007/s11219-007-9039-yopenalex-snapshot
Test frame updating in CPM testing of Prolog programs
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90200-3openalex-snapshot
A compositional semantics for logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90026-4openalex-snapshot
The s-semantics approach: Theory and applications
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00064-xopenalex-snapshot
Analyzing logic programs using “prop”-ositional logic programs and a magic wand
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.039openalex-snapshot
S-semantics for logic programming: A retrospective look
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.040openalex-snapshot
Abstract interpretation of resolution-based semantics
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00006-0openalex-snapshot
A semantic basis for the termination analysis of logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00012-6openalex-snapshot
Operational and goal-independent denotational semantics for Prolog with cut
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.1093/logcom/12.3.497openalex-snapshot
Generalizing Def and Pos to Type Analysis
inferred← citeshttps://doi.org/10.7551/mitpress/4301.003.0036openalex-snapshot
Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics
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.