An overview of valued CSP and related results - INRAE - Institut national de recherche pour l’agriculture, l’alimentation et l’environnement Accéder directement au contenu
Proceedings/Recueil Des Communications Année : 1997

An overview of valued CSP and related results

Résumé

The Constraint Satisfaction Problem (CSP) framework is getting more and more widely used to represent and solve constraint-based problems in several areas: automatic or aided decision, scheduling, diagnosis, constraint programming... This wide range of applications has brought to light some weaknesses of the intial framework. Among these, one of the most important one is the problem of "facing inconsistency" i.e..the fact that the translation of a real problem for which a solution is sought yields a CSP with no solution. Several different but closely related answers, relying on the idea of "soft constraints", have been considered recently. To better identify what distinguishes and relates all these approaches, two general algebraic generalizations have been defined. This paper presents the so-called valued CSP generalization.
Fichier non déposé

Dates et versions

hal-02838463 , version 1 (07-06-2020)

Identifiants

  • HAL Id : hal-02838463 , version 1
  • PRODINRA : 135961

Citer

Thomas Schiex. An overview of valued CSP and related results. 4. European Congress on Fuzzy and Intelligent Technologies, 1997, Aachen, Germany. n.p., 1997. ⟨hal-02838463⟩
3 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More