Conjunto: Constraint Logic Programming with Finite Set Domains - Université de Montpellier Accéder directement au contenu
Communication Dans Un Congrès Année : 1994

Conjunto: Constraint Logic Programming with Finite Set Domains


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.
Fichier principal
Vignette du fichier
ilps94.pdf (342.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01742416 , version 1 (24-03-2018)


  • HAL Id : hal-01742416 , version 1


Carmen Gervet. Conjunto: Constraint Logic Programming with Finite Set Domains. ILPS, 1994, Ithaca, United States. ⟨hal-01742416⟩
199 Consultations
171 Téléchargements


Gmail Facebook X LinkedIn More