On the public citation graph
Logical aspects of set constraints
0 signed · 51 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-56503-5_50openalex-snapshot
Solving systems of set constraints using tree automata
inferredcites →https://doi.org/10.1007/3540543961_21openalex-snapshot
Implementing regular tree expressions
inferredcites →https://doi.org/10.1007/978-1-4612-9855-7openalex-snapshot
Lectures on Boolean Algebras
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferredcites →https://doi.org/10.1016/0168-0072(89)90032-8openalex-snapshot
Varieties of complex algebras
inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
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.1992.185545openalex-snapshot
Solving systems of set constraints
inferredcites →https://doi.org/10.1109/lics.1994.316077openalex-snapshot
Systems of set constraints with negative constraints are NEXPTIME-complete
inferredcites →https://doi.org/10.1109/lics.1994.316078openalex-snapshot
Negative set constraints with equality
inferredcites →https://doi.org/10.1109/sfcs.1992.267754openalex-snapshot
Efficient inference of partial types
inferredcites →https://doi.org/10.1109/sfcs.1993.366850openalex-snapshot
Solving systems of set constraints with negated subset relationships
inferredcites →https://doi.org/10.1145/567752.567776openalex-snapshot
Flow analysis and optimization of LISP-like structures
inferredcites →https://doi.org/10.1145/6041.6042openalex-snapshot
On understanding types, data abstraction, and polymorphism
inferredcites →https://doi.org/10.1145/96709.96729openalex-snapshot
A finite presentation theorem for approximating logic programs
inferredcites →https://doi.org/10.1145/99583.99621openalex-snapshot
Static type inference in a dynamically typed language
inferredcites →https://doi.org/10.1184/r1/6603737openalex-snapshot
Automatic computation of data set definitions
inferredcites →https://doi.org/10.2307/2372123openalex-snapshot
Boolean Algebras with Operators. Part I
inferredcites →https://doi.org/10.7146/brics.v1i32.21611openalex-snapshot
Decidability of Systems of Set Constraints with Negative Constraints
inferredcites →https://doi.org/10.7146/dpb.v21i394.6629openalex-snapshot
Efficient Inference of Partial Types
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.1139openalex-snapshot
Decidability of Systems of Set Constraints with Negative Constraints
inferred← citeshttps://doi.org/10.1006/inco.1997.2692openalex-snapshot
Set Constraints in Some Equational Theories
inferred← citeshttps://doi.org/10.1006/inco.1997.2694openalex-snapshot
Set Constraints and Logic Programming
inferred← citeshttps://doi.org/10.1006/inco.2001.2952openalex-snapshot
Set Constraints with Intersection
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_186openalex-snapshot
Rational spaces and set constraints
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_123openalex-snapshot
A complete gentzen-style axiomatization for set constraints
inferred← citeshttps://doi.org/10.1007/3-540-61551-2_67openalex-snapshot
The independence property of a class of set constraints
inferred← citeshttps://doi.org/10.1007/bfb0016861openalex-snapshot
Set constraints and logic programming
inferred← citeshttps://doi.org/10.1007/bfb0016864openalex-snapshot
Some new decidability results on positive and negative set constraints
inferred← citeshttps://doi.org/10.1007/bfb0017466openalex-snapshot
Set constraints: A pearl in research on constraints
inferred← citeshttps://doi.org/10.1007/bfb0030609openalex-snapshot
Inclusion constraints over non-empty sets of trees
inferred← citeshttps://doi.org/10.1007/bfb0030610openalex-snapshot
Grid structures and undecidable constraint theories
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00070-9openalex-snapshot
Rational spaces and set constraints
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.1023/b:cons.0000006182.84033.6eopenalex-snapshot
Disunification in ACI1 Theories
inferred← citeshttps://doi.org/10.1109/lics.1997.614962openalex-snapshot
Set constraints with intersection
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365727openalex-snapshot
Set constraints with projections are in NEXPTIME
inferred← citeshttps://doi.org/10.1145/1734213.1734217openalex-snapshot
Set constraints with projections
inferred← citeshttps://doi.org/10.1145/277650.277667openalex-snapshot
Partial online cycle elimination in inclusion constraint graphs
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.