Belief Constraint Satisfaction Problems

Aouatef Rouahi, Kais Ben Salah, Khaled Ghedira

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Every problem that can be described by a set of variables and a set of constraints among those variables can easily be cast as a Constraint Satisfaction Problem (CSP). In spite of its simplicity, the standard CSP has proven unsuited for modeling ill-defined decision problems, especially, under uncertain circumstances. In such situation, uncertainty evokes the need for softness. Moreover, when the relevance of some constraints depends on other factors, we should prioritize those constraints. Eventually, the modeled uncertainty, as well as the expressed soft and prioritized constraints induce preferences over the solutions set. Previous work employing mathematical uncertainty theories are either uncertainty-based frameworks or preference-based ones. In this paper, we propose a unifying CSP extension, based on the Dempster-Shafer theory, which deals jointly with all these four concepts, i.e., uncertainty, soft and prioritized constraints and preferences over the solutions.

Original languageEnglish
Title of host publication2015 IEEE/ACS 12th International Conference of Computer Systems and Applications, AICCSA 2015
PublisherIEEE Computer Society
ISBN (Electronic)9781509004782
DOIs
StatePublished - 7 Jul 2016
Externally publishedYes
Event12th IEEE/ACS International Conference of Computer Systems and Applications, AICCSA 2015 - Marrakech, Morocco
Duration: 17 Nov 201520 Nov 2015

Publication series

NameProceedings of IEEE/ACS International Conference on Computer Systems and Applications, AICCSA
Volume2016-July

Conference

Conference12th IEEE/ACS International Conference of Computer Systems and Applications, AICCSA 2015
Country/TerritoryMorocco
CityMarrakech
Period17/11/1520/11/15

Fingerprint

Dive into the research topics of 'Belief Constraint Satisfaction Problems'. Together they form a unique fingerprint.

Cite this