In this paper we present Cardinal, a general finite sets constraint solver just made publicly
available in ECLiPSe Constraint System, suitable for combinatorial problem solving by …

The topic of set constraints is a pearl among the research topics on constraints. It combines
theoretical investigations (ranging from logical expressiveness, decidability, algorithms and …

A subtyping/spl tau//spl les//spl tau/'is entailed by a set of subtyping constraints C, written
C|=/spl tau//spl les//spl tau/', if every valuation (mapping of type variables to ground types) …

Set constraints are inclusions between expressions denoting sets of trees. The efficiency of
their satisfiability test is a central issue in set-based program analysis, their main application …

We study entailment of structural and nonstructural recursive subtyping constraints.
Constraints are formal inequalities between type expressions, interpreted over an ordered …

Set constraints is a suitable formalism for static analysis of programs. However, it is known
that the complexity of set constraint problems in the most general cases is very high …

We present a new constraint system called Ines. Its constraints are conjunctions of
inclusions t_1 ⊆ t_2 between first-order terms (without set operators) which are interpreted …

Systems are subject to faults in their components, affecting their overall behaviour. In a black-
box system, such faults only become apparent in the output when appropriate inputs are …

Feature trees have been used to accommodate records in constraint programming and
record like structures in computational linguistics. Feature trees model records, and feature …

The complexity of set constraints has been extensively studied over the last years and was
often found quite high. At the lower end of expressiveness, there are atomic set constraints …