On the public citation graph

An algebraic approach to sharing analysis of logic programs

https://doi.org/10.1007/bfb0032734
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.1007/3-540-16442-1_25openalex-snapshot
An application of abstract interpretation of logic programs: Occur check reduction
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/bf03037324openalex-snapshot
The occur-check problem in Prolog
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/0743-1066(92)90034-zopenalex-snapshot
Static analysis of logic programs for independent and parallelism
inferredcites →https://doi.org/10.1016/0743-1066(92)90035-2openalex-snapshot
Compile-time derivation of variable dependency using abstract interpretation
inferredcites →https://doi.org/10.1016/0743-1066(92)90053-6openalex-snapshot
Global flow analysis as a practical compilation tool
inferredcites →https://doi.org/10.1016/0743-1066(95)00038-0openalex-snapshot
Generalized semantics and abstract interpretation for constraint logic programs
inferredcites →https://doi.org/10.1016/0743-1066(95)00064-xopenalex-snapshot
Analyzing logic programs using “prop”-ositional logic programs and a magic wand
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.1016/s0747-7171(89)80026-4openalex-snapshot
Adventures in associative-commutative unification
inferredcites →https://doi.org/10.1093/oso/9780198537465.003.0002openalex-snapshot
Unification Theory
inferredcites →https://doi.org/10.1109/lics.1991.151654openalex-snapshot
Logic programs as types for logic programs
inferredcites →https://doi.org/10.1145/115865.115872openalex-snapshot
Abstract interpretation of logic programs
inferredcites →https://doi.org/10.1145/115866.115872openalex-snapshot
Abstract interpretation of logic programs
inferredcites →https://doi.org/10.1145/174675.177880openalex-snapshot
Combinations of abstract domains for logic programming
inferredcites →https://doi.org/10.1145/215465.215467openalex-snapshot
A symbolic constraint solving framework for analysis of logic programs
inferredcites →https://doi.org/10.1145/231379openalex-snapshot
Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
inferredcites →https://doi.org/10.1145/231379.231399openalex-snapshot
Practical program analysis using general purpose logic programming systems—a case study
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0074openalex-snapshot
On the Practicality of Abstract Equation Systems
inferredcites →https://doi.org/10.7551/mitpress/4299.003.0042openalex-snapshot
XSB as the Natural Habitat for General Purpose Program Analysis
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-36377-7_6openalex-snapshot
Meta-circular Abstract Interpretation in Prolog
inferred← citeshttps://doi.org/10.1007/3-540-45013-0_6openalex-snapshot
A General Framework for Variable Aliasing: Towards Optimal Operators for Sharing Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_30openalex-snapshot
Negative Ternary Set-Sharing
inferred← citeshttps://doi.org/10.1007/bfb0032733openalex-snapshot
Set-sharing is redundant for pair-sharing
inferred← citeshttps://doi.org/10.1007/s100090050016openalex-snapshot
Semantics-based program analysis for logic-based languages using XSB
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00312-1openalex-snapshot
Set-sharing is redundant for pair-sharing
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00122-4openalex-snapshot
Type dependencies for logic programs using ACI-unification
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10024-9openalex-snapshot
Efficient goal directed bottom-up evaluation of logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10026-2openalex-snapshot
Sharing is optimal
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00007-2openalex-snapshot
An algebraic approach to sharing analysis of logic programs
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.