Mixed constraint satisfaction : a framework for decision problems under incomplete knowledge - Archive ouverte HAL Access content directly
Conference Papers Year : 1996

Mixed constraint satisfaction : a framework for decision problems under incomplete knowledge

(1, 2) , , (3)
1
2
3

Abstract

Constraint satisfaction is a powerful tool for representing and solving decision problems with complete knowledge about the world. We extend the CSP framework so as to represent decision problems under incomplete knowledge. The basis of the extension consists in a distinction between controllable and uncontrollable variables - hence the terminology "mixed CSP" - and a "solution" gives actually a conditional decision. We study the complexity of deciding the consistency of a mixed CSP. As the problem is generally intractable, we propose an algorithm for finding an approximate solution.
Fichier principal
Vignette du fichier
AAAI96-026.pdf (1.08 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02770543 , version 1 (18-01-2023)

Identifiers

  • HAL Id : hal-02770543 , version 1
  • PRODINRA : 136083

Cite

Hélène Fargier, Jérôme Lang, Thomas Schiex. Mixed constraint satisfaction : a framework for decision problems under incomplete knowledge. National American Conference on Artificial Intelligence 1996, 1996, Portland, United States. ⟨hal-02770543⟩
0 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More