On the public citation graph
Solving classes of set constraints with tree automata
0 signed · 24 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.1006/inco.2001.2952openalex-snapshot
Set Constraints with Intersection
inferredcites →https://doi.org/10.1007/3540543961_21openalex-snapshot
Implementing regular tree expressions
inferredcites →https://doi.org/10.1007/bfb0030609openalex-snapshot
Inclusion constraints over non-empty sets of trees
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/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/182409.182495openalex-snapshot
Set-based analysis of ML programs
inferredcites →https://doi.org/10.1145/182590.182495openalex-snapshot
Set-based analysis of ML 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/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-45099-3_16openalex-snapshot
Tree Schemata and Fair Termination
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_10openalex-snapshot
Combining Equational Tree Automata over AC and ACI Theories
inferred← citeshttps://doi.org/10.1007/bfb0017466openalex-snapshot
Set constraints: A pearl in research on constraints
inferred← citeshttps://doi.org/10.1007/bfb0054183openalex-snapshot
Set-based analysis of reactive infinite-state systems
inferred← citeshttps://doi.org/10.1007/s10601-006-9012-6openalex-snapshot
Cardinal: A Finite Sets Constraint Solver
inferred← citeshttps://doi.org/10.1017/s1471068402001473openalex-snapshot
Using parametric set constraints for locating errors in CLP programs
inferred← citeshttps://doi.org/10.1023/a:1009826603139openalex-snapshot
Generalized Definite Set Constraints
inferred← citeshttps://doi.org/10.1109/lics.1999.782623openalex-snapshot
Entailment of atomic set constraints is PSPACE-complete
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.