On the public citation graph

The complexity of set constraints

https://doi.org/10.1007/bfb0049320
0 signed · 87 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.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.1016/0304-3975(80)90069-9openalex-snapshot
On equations for regular languages, finite automata, and sequential networks
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.1993.366850openalex-snapshot
Solving systems of set constraints with negated subset relationships
inferredcites →https://doi.org/10.1145/318593.318603openalex-snapshot
Declaration-free type checking
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
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.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.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.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.1998.2747openalex-snapshot
Set Constraints and Automata
inferred← citeshttps://doi.org/10.1006/inco.1999.2849openalex-snapshot
Complexity of Nilpotent Unification and Matching Problems
inferred← citeshttps://doi.org/10.1006/inco.2001.2952openalex-snapshot
Set Constraints with Intersection
inferred← citeshttps://doi.org/10.1006/inco.2001.2973openalex-snapshot
Tarskian Set Constraints
inferred← citeshttps://doi.org/10.1007/11505877_29openalex-snapshot
On Language Inequalities XK ⊆ LX
inferred← citeshttps://doi.org/10.1007/11753728_30openalex-snapshot
Language Equations with Symmetric Difference
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-45653-8_15openalex-snapshot
Unification in a Description Logic with Transitive Closure of Roles
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_32openalex-snapshot
Higher-Order Positive Set Constraints
inferred← citeshttps://doi.org/10.1007/3-540-58601-6_110openalex-snapshot
Set constraints: Results, applications and future directions
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-59340-3_8openalex-snapshot
Rewriting and tree automata
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-61511-3_90openalex-snapshot
Unification and matching modulo nilpotence
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-030-50143-3_27openalex-snapshot
Dempster-Shafer Theory: Ηow Constraint Programming Can Help
inferred← citeshttps://doi.org/10.1007/978-3-031-01892-3openalex-snapshot
Foundations of Data Quality Management
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_35openalex-snapshot
Set Constraints on Regular Terms
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_47openalex-snapshot
The Power of Commuting with Finite Sets of Words
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_6openalex-snapshot
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_11openalex-snapshot
ACID-Unification Is NEXPTIME-Decidable
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_19openalex-snapshot
Polynomial Constraints for Sets with Cardinality Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_3openalex-snapshot
What Do We Know About Language Equations?
inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_11openalex-snapshot
Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-39038-8_17openalex-snapshot
QUIC Graphs: Relational Invariant Generation for Containers
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_15openalex-snapshot
Membership-Constraints and Complexity in Logic Programming with Sets
inferred← citeshttps://doi.org/10.1007/bfb0016862openalex-snapshot
Set constraints in some equational theories
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/bfb0032737openalex-snapshot
Program analysis using mixed term and set constraints
inferred← citeshttps://doi.org/10.1007/bfb0049332openalex-snapshot
Logical aspects of set constraints
inferred← citeshttps://doi.org/10.1007/bfb0052363openalex-snapshot
Unification and matching in process algebras
inferred← citeshttps://doi.org/10.1007/bfb0055809openalex-snapshot
Tarskian set constraints are in NEXPTIME
inferred← citeshttps://doi.org/10.1007/s00165-010-0164-1openalex-snapshot
Compositional refinement in agent-based security protocols
inferred← citeshttps://doi.org/10.1007/s00224-006-1321-zopenalex-snapshot
The Power of Commuting with Finite Sets of Words
inferred← citeshttps://doi.org/10.1007/s10817-004-2279-7openalex-snapshot
Unification Modulo ACUI Plus Distributivity Axioms
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00070-9openalex-snapshot
Rational spaces and set constraints
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.062openalex-snapshot
Checking Emptiness of Non-Deterministic Regular Types with Set Operators
inferred← citeshttps://doi.org/10.1016/j.ic.2014.05.001openalex-snapshot
Computational completeness of equations over sets of natural numbers
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.02.004openalex-snapshot
Closure properties and decision problems of dag automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.08.002openalex-snapshot
Decision problems for language equations
inferred← citeshttps://doi.org/10.1017/s0956796801003938openalex-snapshot
Set constraints for destructive array update optimization
inferred← citeshttps://doi.org/10.1023/a:1009826603139openalex-snapshot
Generalized Definite Set Constraints
inferred← citeshttps://doi.org/10.1051/ita:2007010openalex-snapshot
Deciding inclusion of set constants over infinite non-strict data structures
inferred← citeshttps://doi.org/10.1093/comjnl/46.4.401openalex-snapshot
An Algorithm for Validating ASN.1 (X.680) Specifications using Set Constraints
inferred← citeshttps://doi.org/10.1109/iccl.1998.674169openalex-snapshot
Set constraints for destructive array update optimization
inferred← citeshttps://doi.org/10.1109/lics.1994.316077openalex-snapshot
Systems of set constraints with negative constraints are NEXPTIME-complete
inferred← citeshttps://doi.org/10.1109/lics.1994.316078openalex-snapshot
Negative set constraints with equality
inferred← citeshttps://doi.org/10.1109/lics.1996.561313openalex-snapshot
Tarskian set constraints
inferred← citeshttps://doi.org/10.1109/lics.1996.561463openalex-snapshot
Solving linear equations over polynomial semirings
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.1109/sfcs.1993.366850openalex-snapshot
Solving systems of set constraints with negated subset relationships
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365727openalex-snapshot
Set constraints with projections are in NEXPTIME
inferred← citeshttps://doi.org/10.1145/1250734.1250772openalex-snapshot
Regularly annotated set constraints
inferred← citeshttps://doi.org/10.1145/1352431.1352482openalex-snapshot
Schema polynomials and applications
inferred← citeshttps://doi.org/10.1145/1353343.1353394openalex-snapshot
Schema polynomials and applications
inferred← citeshttps://doi.org/10.1145/1380572.1380577openalex-snapshot
Flat and one-variable clauses
inferred← citeshttps://doi.org/10.1145/1734213.1734217openalex-snapshot
Set constraints with projections
inferred← citeshttps://doi.org/10.1145/1989323.1989373openalex-snapshot
Interaction between record matching and data repairing
inferred← citeshttps://doi.org/10.1145/292540.292553openalex-snapshot
Aggregate structure identification and its application to program analysis
inferred← citeshttps://doi.org/10.2200/s00439ed1v01y201207dtm030openalex-snapshot
Foundations of Data Quality Management
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint programming
inferred← citeshttps://doi.org/10.25368/2022.154openalex-snapshot
On Language Equations with One-sided Concatenation
inferred← citeshttps://doi.org/10.25368/2022.185openalex-snapshot
Solving Language Equations and Disequations Using Looping Tree Automata with Colors
inferred← citeshttps://doi.org/10.3233/fi-2013-870openalex-snapshot
On Language Equations with One-sided Concatenation
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0508123openalex-snapshot
On Algorithms and Complexity for Sets with Cardinality Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9811015openalex-snapshot
An Emptiness Algorithm for Regular Types with Set Operators
inferred← citeshttps://doi.org/10.7146/brics.v1i32.21611openalex-snapshot
Decidability of Systems of Set Constraints with Negative Constraints
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.