On the public citation graph
Grid structures and undecidable constraint theories
0 signed · 38 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.1994.1043openalex-snapshot
Syntacticness, Cycle-Syntacticness, and Shallow Theories
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-54233-7_154openalex-snapshot
On logics, tilings, and automata
inferredcites →https://doi.org/10.1007/3-540-55210-3_181openalex-snapshot
Equality and disequality constraints on direct subterms in tree automata
inferredcites →https://doi.org/10.1007/3-540-58201-0_88openalex-snapshot
Pumping, cleaning and symbolic constraints solving
inferredcites →https://doi.org/10.1007/3-540-61464-8_59openalex-snapshot
The first-order theory of one-step rewriting is undecidable
inferredcites →https://doi.org/10.1007/3-540-62950-5_75openalex-snapshot
Undecidability of the first order theory of one-step right ground rewriting
inferredcites →https://doi.org/10.1007/3-540-62950-5_76openalex-snapshot
The first-order theory of one step rewriting in linear noetherian systems is undecidable
inferredcites →https://doi.org/10.1007/3-540-63104-6_4openalex-snapshot
On equality up-to constraints over finite trees, context unification, and one-step rewriting
inferredcites →https://doi.org/10.1007/bf02218635openalex-snapshot
Elementary lattice theories for ideals in polynomial rings
inferredcites →https://doi.org/10.1007/bfb0016864openalex-snapshot
Some new decidability results on positive and negative set constraints
inferredcites →https://doi.org/10.1007/bfb0049332openalex-snapshot
Logical aspects of set constraints
inferredcites →https://doi.org/10.1016/0168-0072(91)90054-popenalex-snapshot
The structure of the models of decidable monadic theories of graphs
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferredcites →https://doi.org/10.1090/s0002-9904-1968-12122-6openalex-snapshot
Decidability of second-order theories and automata on infinite trees
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1090/tranopenalex-snapshot
Transactions of the American Mathematical Society
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/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/300307.1040360openalex-snapshot
Elements of the Theory of Computation
inferredcites →https://doi.org/10.1145/96709.96729openalex-snapshot
A finite presentation theorem for approximating logic programs
inferredcites →https://doi.org/10.2307/2273878openalex-snapshot
Monadic second order definable relations on the binary tree
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.2002.3151openalex-snapshot
The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_15openalex-snapshot
Weakly Regular Relations and Applications
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_22openalex-snapshot
Predicate Logic and Tree Automata with Tests
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_10openalex-snapshot
A New Result about the Decidability of the Existential One-Step Rewriting Theory
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_9openalex-snapshot
Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_6openalex-snapshot
The Existential Fragment of the One-Step Parallel Rewriting Theory
inferred← citeshttps://doi.org/10.1007/bfb0017466openalex-snapshot
Set constraints: A pearl in research on constraints
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00030-2openalex-snapshot
The fragment of the first-order theory of atomic set constraints is -hard
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00036-3openalex-snapshot
On rewrite constraints and context unification
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.1016/s0304-3975(98)00083-8openalex-snapshot
The first-order theory of linear one-step rewriting is undecidable
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.