On the public citation graph

Inclusion constraints over non-empty sets of trees

https://doi.org/10.1007/bfb0030609
0 signed · 44 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.1139openalex-snapshot
Decidability of Systems of Set Constraints with Negative Constraints
inferredcites →https://doi.org/10.1007/3-540-60688-2_43openalex-snapshot
Constraints for free in concurrent computation
inferredcites →https://doi.org/10.1007/3-540-61551-2_67openalex-snapshot
The independence property of a class of set constraints
inferredcites →https://doi.org/10.1007/3-540-61630-6_17openalex-snapshot
The Oz Programming Model
inferredcites →https://doi.org/10.1007/bfb0030609openalex-snapshot
Inclusion constraints over non-empty sets of trees
inferredcites →https://doi.org/10.1007/bfb0049332openalex-snapshot
Logical aspects of set constraints
inferredcites →https://doi.org/10.1016/s0049-237x(08)70560-3openalex-snapshot
Chapter 23 Axiomatizable Classes of Locally Free Algebras of Various Types
inferredcites →https://doi.org/10.1016/s0049-237x(08)71129-7openalex-snapshot
The Type Free Lambda Calculus
inferredcites →https://doi.org/10.1016/s0747-7171(89)80017-3openalex-snapshot
Equational problems anddisunification
inferredcites →https://doi.org/10.1109/lics.1988.5132openalex-snapshot
Complete axiomatizations of the algebras of finite, rational and infinite trees
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.316078openalex-snapshot
Negative set constraints with equality
inferredcites →https://doi.org/10.1109/lics.1996.561313openalex-snapshot
Tarskian set constraints
inferredcites →https://doi.org/10.1109/sfcs.1993.366850openalex-snapshot
Solving systems of set constraints with negated subset relationships
inferredcites →https://doi.org/10.1109/sfcs.1994.365727openalex-snapshot
Set constraints with projections are in NEXPTIME
inferredcites →https://doi.org/10.1145/151261.151264openalex-snapshot
Taxonomic syntax for first order inference
inferredcites →https://doi.org/10.1145/151261.151265openalex-snapshot
Automatic recognition of tractability in inference relations
inferredcites →https://doi.org/10.1145/165180.165188openalex-snapshot
Type inclusion constraints and type inference
inferredcites →https://doi.org/10.1145/174675.177847openalex-snapshot
Soft typing with conditional types
inferredcites →https://doi.org/10.1145/182409.182495openalex-snapshot
Set-based analysis of ML programs
inferredcites →https://doi.org/10.1145/237721.237801openalex-snapshot
Functional computation as concurrent computation
inferredcites →https://doi.org/10.1145/363647.363681openalex-snapshot
Automated complexity analysis based on ordered resolution
inferredcites →https://doi.org/10.21236/ada270597openalex-snapshot
Set Based Analysis of ML Programs
inferredcites →https://doi.org/10.2307/2274155openalex-snapshot
Handbook of mathematical logic, edited by Jon Barwise with the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, and A. S. Troelstra, Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 (© 1977), xi + 1165…
inferredcites →https://doi.org/10.7551/mitpress/2086.001.0001openalex-snapshot
Concurrent Constraint 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.2001.2952openalex-snapshot
Set Constraints with Intersection
inferred← citeshttps://doi.org/10.1006/inco.2001.2963openalex-snapshot
Simplifying Subtyping Constraints: A Theory
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-49366-2_14openalex-snapshot
Type Inference for First-Class Messages with Feature 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/978-3-540-71316-6_9openalex-snapshot
Anti-pattern Matching
inferred← citeshttps://doi.org/10.1007/bfb0017430openalex-snapshot
Solving classes of set constraints with tree automata
inferred← citeshttps://doi.org/10.1007/bfb0017447openalex-snapshot
Ordering Constraints over Feature Trees
inferred← citeshttps://doi.org/10.1007/bfb0017466openalex-snapshot
Set constraints: A pearl in research on constraints
inferred← citeshttps://doi.org/10.1007/bfb0032737openalex-snapshot
Program analysis using mixed term and set constraints
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.01.007openalex-snapshot
Anti-patterns for rule-based languages
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/a:1009826603139openalex-snapshot
Generalized Definite Set Constraints
inferred← citeshttps://doi.org/10.1109/lics.1997.614962openalex-snapshot
Set constraints with intersection
inferred← citeshttps://doi.org/10.1109/lics.1999.782623openalex-snapshot
Entailment of atomic set constraints is PSPACE-complete
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint programming
inferred← citeshttps://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot
Advanced Topics in Types and Programming Languages
showing the first 17 of 18 · page through all 18
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.