On the public citation graph

Set constraints: A pearl in research on constraints

https://doi.org/10.1007/bfb0017466
0 signed · 89 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.1058openalex-snapshot
Safety Analysis versus Type Inference
inferredcites →https://doi.org/10.1006/inco.1995.1139openalex-snapshot
Decidability of Systems of Set Constraints with Negative Constraints
inferredcites →https://doi.org/10.1006/inco.1997.2692openalex-snapshot
Set Constraints in Some Equational Theories
inferredcites →https://doi.org/10.1006/inco.2001.2952openalex-snapshot
Set Constraints with Intersection
inferredcites →https://doi.org/10.1007/3-540-19488-6_146openalex-snapshot
Type inference with partial types
inferredcites →https://doi.org/10.1007/3-540-54444-5_123openalex-snapshot
Short overview of the CLPS system
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/3-540-58601-6_110openalex-snapshot
Set constraints: Results, applications and future directions
inferredcites →https://doi.org/10.1007/3-540-59293-8_186openalex-snapshot
Rational spaces and set constraints
inferredcites →https://doi.org/10.1007/3-540-60915-6_6openalex-snapshot
An automata-theoretic approach to linear temporal logic
inferredcites →https://doi.org/10.1007/3-540-61440-0_123openalex-snapshot
A complete gentzen-style axiomatization for set constraints
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-61580-6_7openalex-snapshot
Regular approximation of computation paths in logic and functional languages
inferredcites →https://doi.org/10.1007/3-540-61630-6_17openalex-snapshot
The Oz Programming Model
inferredcites →https://doi.org/10.1007/3540543961_21openalex-snapshot
Implementing regular tree expressions
inferredcites →https://doi.org/10.1007/978-3-642-60858-2_23openalex-snapshot
The Oz Programming Model
inferredcites →https://doi.org/10.1007/978-94-009-0349-4_15openalex-snapshot
Membership-Constraints and Complexity in Logic Programming with Sets
inferredcites →https://doi.org/10.1007/bf00137870openalex-snapshot
Interval propagation to reason about sets: Definition and implementation of a practical language
inferredcites →https://doi.org/10.1007/bf01458217openalex-snapshot
Über Möglichkeiten im Relativkalkül
inferredcites →https://doi.org/10.1007/bfb0016861openalex-snapshot
Set constraints and logic programming
inferredcites →https://doi.org/10.1007/bfb0016862openalex-snapshot
Set constraints in some equational theories
inferredcites →https://doi.org/10.1007/bfb0016864openalex-snapshot
Some new decidability results on positive and negative set constraints
inferredcites →https://doi.org/10.1007/bfb0017430openalex-snapshot
Solving classes of set constraints with tree automata
inferredcites →https://doi.org/10.1007/bfb0017447openalex-snapshot
Ordering Constraints over Feature Trees
inferredcites →https://doi.org/10.1007/bfb0030609openalex-snapshot
Inclusion constraints over non-empty sets of trees
inferredcites →https://doi.org/10.1007/bfb0030610openalex-snapshot
Grid structures and undecidable constraint theories
inferredcites →https://doi.org/10.1007/bfb0049320openalex-snapshot
The complexity of set constraints
inferredcites →https://doi.org/10.1007/bfb0049332openalex-snapshot
Logical aspects of set constraints
inferredcites →https://doi.org/10.1007/bfb0054183openalex-snapshot
Set-based analysis of reactive infinite-state systems
inferredcites →https://doi.org/10.1016/0020-0190(94)00130-8openalex-snapshot
Haskell overloading is DEXPTIME-complete
inferredcites →https://doi.org/10.1016/0022-0000(86)90026-7openalex-snapshot
Automata-theoretic techniques for modal logics of programs
inferredcites →https://doi.org/10.1016/0022-0000(90)90033-hopenalex-snapshot
Logic programming with sets
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.1016/0304-3975(85)90077-5openalex-snapshot
Alternating tree automata
inferredcites →https://doi.org/10.1016/0304-3975(96)00070-9openalex-snapshot
Rational spaces and set constraints
inferredcites →https://doi.org/10.1016/0743-1066(91)80002-uopenalex-snapshot
A type system for logic programs
inferredcites →https://doi.org/10.1016/0743-1066(91)90036-oopenalex-snapshot
Set constructors in a logic database language
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7070-3openalex-snapshot
Solvable Cases of the Decision Problem
inferredcites →https://doi.org/10.1109/focs.1961.13openalex-snapshot
Delayed-logic and finite-state machines
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.185544openalex-snapshot
An engine for logic program analysis
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/lics.1996.561313openalex-snapshot
Tarskian set constraints
inferredcites →https://doi.org/10.1109/lics.1997.614960openalex-snapshot
On the cubic bottleneck in subtyping and flow analysis
inferredcites →https://doi.org/10.1109/lics.1997.614962openalex-snapshot
Set constraints with intersection
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/143165.143184openalex-snapshot
Inductive definitions, semantics and abstract interpretations
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/199448.199533openalex-snapshot
A type system equivalent to flow analysis
inferredcites →https://doi.org/10.1145/224164.224199openalex-snapshot
Formal language, grammar and set-constraint-based program analysis by abstract interpretation
inferredcites →https://doi.org/10.1145/258915.258939openalex-snapshot
Linear-time subtransitive control flow analysis
inferredcites →https://doi.org/10.1145/258948.258954openalex-snapshot
Systematic realisation of control flow analyses for CML
inferredcites →https://doi.org/10.1145/258948.258963openalex-snapshot
On the complexity of set-based analysis
inferredcites →https://doi.org/10.1145/263699.263753openalex-snapshot
A demand-driven set-based analysis
inferredcites →https://doi.org/10.1145/318593.318603openalex-snapshot
Declaration-free type checking
inferredcites →https://doi.org/10.1145/321958.321960openalex-snapshot
Resolution Strategies as Decision Procedures
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.21236/ada270597openalex-snapshot
Set Based Analysis of ML Programs
inferredcites →https://doi.org/10.21236/ada274112openalex-snapshot
Set Based Analysis of Arithmetic
inferredcites →https://doi.org/10.2307/2964059openalex-snapshot
W. Ackermann. Solvable cases of the decision problem. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam1954, VIII + 114 pp.
inferredcites →https://doi.org/10.4324/9781315102481-5openalex-snapshot
Information processing
inferredcites →https://doi.org/10.7551/mitpress/4301.003.0038openalex-snapshot
Practical Model-Based Static Analysis for Definite Logic Programs
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0062openalex-snapshot
Compiling Intensional Sets in CLP

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-45406-3_1openalex-snapshot
Constraints and Constraint Solving: An Introduction
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_2openalex-snapshot
Constraint Solving on Terms
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-45789-5_5openalex-snapshot
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
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-0-387-35602-0_22openalex-snapshot
Implementing Constraint Solvers in B-Prolog
inferred← citeshttps://doi.org/10.1007/978-3-030-47147-7_6openalex-snapshot
Set Constraints, Pattern Match Analysis, and SMT
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-94-015-9383-0_20openalex-snapshot
Nondeterministic Actions in the Fluent Calculus: Disjunctive State Update Axioms
inferred← citeshttps://doi.org/10.1007/s10601-006-9012-6openalex-snapshot
Cardinal: A Finite Sets Constraint Solver
inferred← citeshttps://doi.org/10.1017/s1471068406002882openalex-snapshot
Demand analysis with partial predicates
inferred← citeshttps://doi.org/10.1109/lics.2002.1029829openalex-snapshot
Tree extension algebras: logics, automata, and query languages
inferred← citeshttps://doi.org/10.1145/1140335.1140357openalex-snapshot
Collection analysis for Horn clause programs
inferred← citeshttps://doi.org/10.1145/2338626.2338632openalex-snapshot
Efficient reasoning about data trees via integer linear programming
inferred← citeshttps://doi.org/10.25368/2022.185openalex-snapshot
Solving Language Equations and Disequations Using Looping Tree Automata with Colors
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.