Conjunto: Constraint Logic Programming with Finite Set Domains

Abstract : Combinatorial problems involving sets and relations are currently tackled by integer programming and expressed with vectors or matrices of 0-1 variables. This is efficient but not flexible and unnatural in problem formulation. Toward a natural programming of combinatorial problems based on sets, graphs or relations, we define a new CLP language with set constraints. This language Conjunto aims at combining the declarative aspect of Prolog with the efficiency of constraint solving techniques. We propose to constrain a set variable to range over finite set domains specified by lower and upper bounds for set inclusion. Conjunto is based on the inclusion and disjointness constraints applied to set expressions which comprise the union, intersection and diffirence symbols. The main contribution herein is the constraint handler which performs constraint propagation by applying consistency techniques over set constraints.
Type de document :
Communication dans un congrès
ILPS, 1994, Ithaca, United States
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.umontpellier.fr/hal-01742416
Contributeur : Carmen Gervet <>
Soumis le : samedi 24 mars 2018 - 19:59:47
Dernière modification le : mercredi 18 juillet 2018 - 20:02:03
Document(s) archivé(s) le : jeudi 13 septembre 2018 - 08:06:33

Fichier

ilps94.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01742416, version 1

Citation

Carmen Gervet. Conjunto: Constraint Logic Programming with Finite Set Domains. ILPS, 1994, Ithaca, United States. 〈hal-01742416〉

Partager

Métriques

Consultations de la notice

106

Téléchargements de fichiers

7