On the public citation graph
Some new decidability results on positive and negative set constraints
0 signed · 27 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.1995.1139openalex-snapshot
Decidability of Systems of Set Constraints with Negative Constraints
inferredcites →https://doi.org/10.1007/3-540-55602-8_163openalex-snapshot
Sorted unification using set constraints
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/bfb0049332openalex-snapshot
Logical aspects of set constraints
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.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.1145/567752.567776openalex-snapshot
Flow analysis and optimization of LISP-like structures
inferredcites →https://doi.org/10.1145/96709.96729openalex-snapshot
A finite presentation theorem for approximating logic programs
inferredcites →https://doi.org/10.1184/r1/6603737openalex-snapshot
Automatic computation of data set definitions
inferredcites →https://doi.org/10.7146/brics.v1i32.21611openalex-snapshot
Decidability of Systems of Set Constraints with Negative Constraints
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_25openalex-snapshot
Tree Automata with Global Constraints
inferred← citeshttps://doi.org/10.1007/bfb0017466openalex-snapshot
Set constraints: A pearl in research on constraints
inferred← citeshttps://doi.org/10.1007/bfb0030610openalex-snapshot
Grid structures and undecidable constraint theories
inferred← citeshttps://doi.org/10.1007/bfb0030616openalex-snapshot
E-unification by means of tree tuple synchronized grammars
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00032-3openalex-snapshot
Grid structures and undecidable constraint theories
inferred← citeshttps://doi.org/10.1109/lics.2010.28openalex-snapshot
The Emptiness Problem for Tree Automata with Global Constraints
inferred← citeshttps://doi.org/10.1142/s012905411000743xopenalex-snapshot
TREE AUTOMATA WITH GLOBAL CONSTRAINTS
inferred← citeshttps://doi.org/10.46298/dmtcs.240openalex-snapshot
E-unification by means of tree tuple synchronized grammars
inferred← citeshttps://doi.org/10.5821/dissertation-2117-96348openalex-snapshot
Tree automata with constraints and tree homomorphisms
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.