Configuring the Webpage Content through Conditional Constraints and Preferences

  • Eisa Alanazi
  • Malek Mouhoub
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8482)


Configuring the webpage content to reflect the user desires is highly demanded in the era of personalization. The problem can be viewed as a preference-based constraint problem including a set of components forming the webpage along with the preferences. Our goal is then to locate each of these components such that the user preferences are maximized. Additionally, constraints might exist between different components of the given page. We investigate the problem of handling the web page content based on user preferences and constraints. Unlike previous attempts, we model the constraint part as an instance of the conditional CSP. This gives further expressive power to handle different relations among components. The preferences are expressed through the well-known CP-Nets graphical model.


User Preference Activity Constraint Constraint Network Partial Assignment News Portal 
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.
    Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: AAAI, pp. 25–32 (1990)Google Scholar
  2. 2.
    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 (JAIR) 21, 135–191 (2004)zbMATHMathSciNetGoogle Scholar
  3. 3.
    Dechter, R.: Constraint processing. Elsevier Morgan Kaufmann (2003)Google Scholar
  4. 4.
    Mouhoub, M., Sukpan, A.: Managing conditional and composite csps. In: Canadian Conference on AI, pp. 216–227 (2007)Google Scholar
  5. 5.
    Gelle, E., Sabin, M.: Solving methods for conditional constraint satisfaction. In: IJCAI 2003, pp. 7–12 (2003)Google Scholar
  6. 6.
    Brafman, R.I., Friedman, D.A.: Adaptive rich media presentations via preference-based constrained optimization. In: Preferences (2004)Google Scholar
  7. 7.
    Kuppusamy, K.S., Aghila, G.: Live-marker: A personalized web page content marking tool. CoRR abs/1202.2615 (2012)Google Scholar
  8. 8.
    Brafman, R.I., Domshlak, C., Shimony, S.E.: Qualitative decision making in adaptive presentation of structured information. ACM Trans. Inf. Syst. 22, 503–539 (2004)CrossRefGoogle Scholar
  9. 9.
    Domshlak, C., Brafman, R.I., Shimony, S.E.: Preference-based configuration of web page content. In: IJCAI, pp. 1451–1456 (2001)Google Scholar
  10. 10.
    Sabin, M., Freuder, E.C., Wallace, R.J.: Greater efficiency for conditional constraint satisfaction. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 649–663. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
    Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8, 99–118 (1977)CrossRefzbMATHGoogle Scholar
  12. 12.
    Alanazi, E., Mouhoub, M.: Arc consistency for CP-nets under constraints. In: FLAIRS (2012)Google Scholar
  13. 13.
    Mohammed, B., Mouhoub, M., Alanazi, E., Sadaoui, S.: Data mining techniques and preference learning in recommender systems. Computer & Information Science 6 (2013)Google Scholar
  14. 14.
    Jiang, W., Sadaoui, S.: Evaluating and ranking semantic offers according to users’interests. Journal of Electronic Commerce Research 13 (2012)Google Scholar
  15. 15.
    Mouhoub, M., Jashmi, B.J.: Heuristic techniques for variable and value ordering in CSPs. In: [23], pp. 457–464Google Scholar
  16. 16.
    Abbasian, R., Mouhoub, M.: An efficient hierarchical parallel genetic algorithm for graph coloring problem. In: [23], pp. 521–528Google Scholar
  17. 17.
    Brafman, R.I., Domshlak, C.: Introducing variable importance tradeoffs into CP-nets. In: UAI, pp. 69–76 (2002)Google Scholar
  18. 18.
    Mouhoub, M., Sukpan, A.: Conditional and composite temporal CSPs. Applied Intelligence 36, 90–107 (2012)CrossRefGoogle Scholar
  19. 19.
    Mouhoub, M., Sukpan, A.: Managing dynamic CSPs with preferences. Applied Intelligence 37, 446–462 (2012)CrossRefGoogle Scholar
  20. 20.
    Mouhoub, M., Sukpan, A.: Managing temporal constraints with preferences. Spatial Cognition & Computation 8, 131–149 (2008)CrossRefGoogle Scholar
  21. 21.
    Mouhoub, M.: Reasoning about Numeric and Symbolic Time Information. In: The Twelfth IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), pp. 164–172. IEEE Computer Society, Vancouver (2000)Google Scholar
  22. 22.
    Mouhoub, M.: Dynamic path consistency for interval-based temporal reasoning. In: Applied Informatics, pp. 393–398 (2003)Google Scholar
  23. 23.
    Krasnogor, N., Lanzi, P.L. (eds.): Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011, Dublin, Ireland, July 12-16. ACM (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Eisa Alanazi
    • 1
  • Malek Mouhoub
    • 1
  1. 1.Department of Computer ScienceUniversity of ReginaReginaCanada

Personalised recommendations