Results

**11 - 14**of**14**### Recueil d’articles

"... Annexes du manuscrit d’HDR — Le calcul de réécritureiiSommaire Présentations du calcul de réécriture 1 Propriétés des calculs à motifs 57 Extensions du calcul de réécriture 75 Expressivité du calcul de réécriture 147 Systèmes de types pour le calcul de réécriture 195 Applications 225Présentations du ..."

Abstract
- Add to MetaCart

(Show Context)
Annexes du manuscrit d’HDR — Le calcul de réécritureiiSommaire Présentations du calcul de réécriture 1 Propriétés des calculs à motifs 57 Extensions du calcul de réécriture 75 Expressivité du calcul de réécriture 147 Systèmes de types pour le calcul de réécriture 195 Applications 225Présentations du calcul de réécriture [CK01] [CKL01a]

### Atomic Set Constraints with Projection

, 2002

"... We investigate a class of set constraints defined as atomic set constraints... ..."

Abstract
- Add to MetaCart

We investigate a class of set constraints defined as atomic set constraints...

### An Undecidable Fragment of the Theory of Set Constraints

, 1998

"... Set constraints are inclusions between expressions denoting sets of trees. In atomic set constraints, the syntax of set expressions is restricted not to contain any Boolean set operators. Using a reduction from the Hilbert's Tenth Problem we prove the undecidability of the 9 8 - fragment ..."

Abstract
- Add to MetaCart

(Show Context)
Set constraints are inclusions between expressions denoting sets of trees. In atomic set constraints, the syntax of set expressions is restricted not to contain any Boolean set operators. Using a reduction from the Hilbert's Tenth Problem we prove the undecidability of the 9 8 - fragment of the first-order theory of atomic set constraints. This is the minimal undecidable fragment of the first-order theory of set constraints if all Boolean connectives (; :) are admitted. 1 Introduction Set constraints are inclusions between expressions denoting sets of trees. Syntactically, they are conjunctions of inclusions between expressions built over variables, constructors (constants and function symbols from a given alphabet) and a choice of set operators that defines the specific class of set constraints. In the theory of set constraints, the atomic formulas are inclusions between set expressions. General formulas are built by adding usual connectives (conjunction, disjunction, negation,...

### Some analysis of the relations between Set Constraints and CLP with Sets

"... Abstract We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint formulae for which both proposals provide suitable procedures for testing constraint satisfiability with respect ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint formulae for which both proposals provide suitable procedures for testing constraint satisfiability with respect to a given privileged interpretation. Specifically, we present a technique for reducing any Set Constraint to a CLP(SET)-constraint; moreover, we show how the satisfiability check for some classes of Set Constraints can be performed by the constraint solver of CLP(SET). 1 Introduction Generally speaking, set-based constraints can be defined as formulae of a first-order language L whose literals make use of classical set-theoretic symbols, such as 2; `; [ : ::. A particular class of set-based constraints, simply called Set Constraints, have been extensively studied in recent years and used as a convenient formalism for program analysis (see [1] for a brief introduction to Set Constraints).