Managing Qualitative Preferences with Constraints

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7665)


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.


Constraint Satisfaction Problem Hard Constraint Partial Assignment Conditional Preference Constraint Satisfaction Problem Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: Cp-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. 21, 135–191 (2004)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Rossi, F., Venable, K.B., Walsh, T.: Preferences in constraint satisfaction and optimization. AI Magazine 29, 58–68 (2008)Google Scholar
  3. 3.
    Boutilier, C., Brafman, R.I., Hoos, H.H., Poole, D.: Preference-based constrained optimization with cp-nets. Computational Intelligence 20, 137–157 (2001)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8, 99–118 (1977)zbMATHCrossRefGoogle Scholar
  5. 5.
    Kumar, V.: Algorithms for constraint satisfaction problems: A survey. AI Magazine 13, 32–44 (1992)Google Scholar
  6. 6.
    Dechter, R.: Constraint processing. Elsevier Morgan Kaufmann (2003)Google Scholar
  7. 7.
    Prestwich, S., Rossi, F., Venable, K.B., Walsh, T.: Constrained cpnets. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol. 3419, Springer, Heidelberg (2005)Google Scholar
  8. 8.
    Domshlak, C., Rossi, F., Venable, K.B., Walsh, T.: Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques. CoRR abs/0905 (2009)Google Scholar
  9. 9.
    Brafman, R.I., Dimopoulos, Y.: A new look at the semantics and optimization methods of cp-networks. In: IJCAI, pp. 1033–1038 (2003)Google Scholar
  10. 10.
    Mouhoub, M., Sukpan, A.: Managing temporal constraints with preferences. Spatial Cognition & Computation 8, 131–149 (2008)CrossRefGoogle Scholar
  11. 11.
    Alanazi, E., Mouhoub, M.: Arc consistency for cp-nets under constraints. In: FLAIRS Conference (2012)Google Scholar
  12. 12.
    Bessière, C., Régin, J.C., Yap, R.H.C., Zhang, Y.: An optimal coarse-grained arc consistency algorithm. Artif. Intell. 165, 165–185 (2005)zbMATHCrossRefGoogle Scholar
  13. 13.
    Xu, K., Li, W.: Exact phase transitions in random constraint satisfaction problems. Journal of Artificial Intelligence Research 12, 93–103 (2000)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Beek, P.V., Dechter, R.: Constraint tightness and looseness versus local and global consistency. Journal of the ACM 44 (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of ReginaReginaCanada

Personalised recommendations