Managing qualitative preferences with constraints

Authors:
Eisa Alanazi;Malek Mouhoub
Affiliations:
Department of Computer Science, University of Regina, Regina, Canada;Department of Computer Science, University of Regina, Regina, Canada
Venue:
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
Year:
2012

Citing 7
Cited 0

Algorithms for constraint-satisfaction problems: a survey

AI Magazine
Constraint tightness and looseness versus local and global consistency

Journal of the ACM (JACM)
Constraint Processing

Constraint Processing
Exact phase transitions in random constraint satisfaction problems

Journal of Artificial Intelligence Research
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
New look at the semantics and optimization methods of CP-networks

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
An optimal coarse-grained arc consistency algorithm

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Preferences and Constraints co-exist naturally in different domains. Thus, handling both of them is of great interest for many real applications. Preferences usually expressed in qualitative format where a constraint satisfaction problem (CSP) is a well known formalism to handle constraints. In this paper, we investigate the problem of managing both qualitative user preferences and system requirements. We model our preference part as an instance of Conditional Preference networks (CP-nets) and the constraints as CSP. We propose a new method to handle both aspects in an efficient manner. Our method is based on the well-known Arc Consistency (AC) propagation technique. The experiments demonstrate that the new approach can save a substantial amount of time for finding the optimal solution for given preferences and constraints.