On the public citation graph

Co-definite set constraints

https://doi.org/10.1007/bfb0052372
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-16761-7_96openalex-snapshot
On fixed-point clones
inferredcites →https://doi.org/10.1007/3-540-58601-6_107openalex-snapshot
Set constraints and set-based analysis
inferredcites →https://doi.org/10.1007/3-540-58601-6_110openalex-snapshot
Set constraints: Results, applications and future directions
inferredcites →https://doi.org/10.1007/bf01744297openalex-snapshot
Formal computations of non deterministic recursive program schemes
inferredcites →https://doi.org/10.1007/bfb0017430openalex-snapshot
Solving classes of set constraints with tree automata
inferredcites →https://doi.org/10.1007/bfb0049332openalex-snapshot
Logical aspects of set constraints
inferredcites →https://doi.org/10.1016/0020-0190(94)00130-8openalex-snapshot
Haskell overloading is DEXPTIME-complete
inferredcites →https://doi.org/10.1016/0022-0000(86)90026-7openalex-snapshot
Automata-theoretic techniques for modal logics of programs
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1109/lics.1990.113732openalex-snapshot
A decision procedure for a class of set constraints
inferredcites →https://doi.org/10.1109/lics.1991.151654openalex-snapshot
Logic programs as types for logic programs
inferredcites →https://doi.org/10.1109/lics.1996.561313openalex-snapshot
Tarskian set constraints
inferredcites →https://doi.org/10.1109/lics.1997.614962openalex-snapshot
Set constraints with intersection
inferredcites →https://doi.org/10.1109/sfcs.1994.365727openalex-snapshot
Set constraints with projections are in NEXPTIME
inferredcites →https://doi.org/10.1145/96709.96729openalex-snapshot
A finite presentation theorem for approximating 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.1006/inco.2001.2952openalex-snapshot
Set Constraints with Intersection
inferred← citeshttps://doi.org/10.1007/11505877_29openalex-snapshot
On Language Inequalities XK ⊆ LX
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_27openalex-snapshot
On the Alternation-Free Horn μ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45610-4_22openalex-snapshot
Atomic Set Constraints with Projection
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_18openalex-snapshot
Improving the Representation of Infinite Trees to Deal with Sets of Trees
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_12openalex-snapshot
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_35openalex-snapshot
Set Constraints on Regular Terms
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_47openalex-snapshot
The Power of Commuting with Finite Sets of Words
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_16openalex-snapshot
Tree Schemata and Fair Termination
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_3openalex-snapshot
What Do We Know About Language Equations?
inferred← citeshttps://doi.org/10.1007/s00224-006-1321-zopenalex-snapshot
The Power of Commuting with Finite Sets of Words
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00152-5openalex-snapshot
An undecidable fragment of the theory of set constraints
inferred← citeshttps://doi.org/10.1017/s1471068406002882openalex-snapshot
Demand analysis with partial predicates
inferred← citeshttps://doi.org/10.1023/a:1009826603139openalex-snapshot
Generalized Definite Set Constraints
inferred← citeshttps://doi.org/10.1051/ita:2007010openalex-snapshot
Deciding inclusion of set constants over infinite non-strict data structures
inferred← citeshttps://doi.org/10.1109/lics.1998.705643openalex-snapshot
The Horn mu-calculus
inferred← citeshttps://doi.org/10.1145/1734213.1734217openalex-snapshot
Set constraints with projections
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint 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.