On the public citation graph

Weak relative pseudo-complements of closure operators

https://doi.org/10.1007/bf01236765
0 signed · 30 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-60360-3_35openalex-snapshot
Complementation in abstract interpretation
inferredcites →https://doi.org/10.1007/978-3-642-67678-9openalex-snapshot
A Compendium of Continuous Lattices
inferredcites →https://doi.org/10.1016/s1385-7258(54)50072-7openalex-snapshot
On the Closure Operators of a Complete Lattice
inferredcites →https://doi.org/10.1145/239912.239914openalex-snapshot
Complementation in abstract interpretation
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks

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.1998.2724openalex-snapshot
Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements
inferred← citeshttps://doi.org/10.1006/inco.1999.2801openalex-snapshot
Closures on CPOs Form Complete Lattices
inferred← citeshttps://doi.org/10.1006/inco.1999.2879openalex-snapshot
A Timed Concurrent Constraint Language
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_35openalex-snapshot
Complementation in abstract interpretation
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_16openalex-snapshot
Complementing logic program semantics
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_230openalex-snapshot
Refining and compressing abstract domains
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_11openalex-snapshot
Concurrent and Reactive Constraint Programming
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.1007/bfb0000474openalex-snapshot
Completeness in abstract interpretation: A domain perspective
inferred← citeshttps://doi.org/10.1007/bfb0017429openalex-snapshot
Semantics and expressive power of a timed concurrent constraint language
inferred← citeshttps://doi.org/10.1007/s000120050089openalex-snapshot
Some properties of complete congruence lattices
inferred← citeshttps://doi.org/10.1007/s11083-025-09705-0openalex-snapshot
On Some Extensions of Weak Relative Pseudocomplementation in Posets
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.021openalex-snapshot
Transforming semantics by abstract interpretation
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00191-1openalex-snapshot
Pseudocomplements of closure operators on posets
inferred← citeshttps://doi.org/10.1016/s0167-6423(97)00034-8openalex-snapshot
Optimal domains for disjunctive abstract interpretation
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00194-7openalex-snapshot
The reduced relative power operation on abstract domains
inferred← citeshttps://doi.org/10.1023/a:1005805026315openalex-snapshot
The Lattice of Completions of an Ordered Set
inferred← citeshttps://doi.org/10.1080/00207161003703205openalex-snapshot
An abstract interpretation-based model for safety semantics
inferred← citeshttps://doi.org/10.1080/00927872.2016.1255893openalex-snapshot
The lattice of closure operators on a subgroup lattice
inferred← citeshttps://doi.org/10.1080/00927872.2021.1883641openalex-snapshot
The lattice of algebraic closure operators on an infinite subgroup lattice
inferred← citeshttps://doi.org/10.1145/239912.239914openalex-snapshot
Complementation in abstract interpretation
inferred← citeshttps://doi.org/10.1145/351268.351281openalex-snapshot
A characterization of symmetric semantics by domain complementation
inferred← citeshttps://doi.org/10.1515/dema-2013-0334openalex-snapshot
Weak relative pseudocomplements in semilattices
inferred← citeshttps://doi.org/10.70675/ba22234cza55fz4daazb100z1881baca8dcdopenalex-snapshot
Spacetime programming : a synchronous language for constraint search
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.