World Wide Web

, Volume 12, Issue 1, pp 27–50 | Cite as

Customising Web Information Systems According to User Preferences

  • Klaus-Dieter Schewe
  • Bernhard Thalheim
  • Qing Wang


Web Information Systems have to serve a variety of users with very diverse preferences regarding content, functionality and presentation. We first investigate the customisation of functionality at a high-level of abstraction, where possible action sequences are represented by an algebraic expression called plot, and user preferences give rise to equations. We show that the problem can be solved by applying conditional term rewriting on the basis of Kleene algebras with tests. By exploiting the idea of weakest preconditions such expressions can be represented by formal power series with coefficients in a Boolean algebra. This gives rise to a sufficient condition for termination based on well-founded orders on such power series. As confluence cannot be guaranteed, we propose critical pair completion to be used in order to enforce the desirable Church-Rosser property. In a second step we parametrise the actions and replace the Boolean conditions by first-order formulae. We show that still term rewriting can be applied, but termination and Church Rosser property become problems that will require manual interaction, in particular, as preference rules will make use of the parameters. On the other hand the presence of first-order conditions can be used to extend the customisation to the content.


web information system personalisation term rewriting Kleene algebra with tests Church-Rosser property termination critical pair completion media type deontic constraint preference rule 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Binemann-Zdanowicz, A., Thalheim, B.: Modeling information services on the basis of ASM semantics. In: Börger, E., Gargantini, A., Riccobene, E. (eds.) Abstract State Machines, Lecture Notes in Computer Science, vol. 2589, pp. 408–410. Springer, New York (2003)Google Scholar
  2. 2.
    Blass, A., Gurevich, J.: Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. 4(4), 578–651 (2003)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Börger, E., Stärk, R.: Abstract State Machines. Springer, Berlin (2003)Google Scholar
  4. 4.
    Ceri, S., Fraternali, P., Bongio, A., Brambilla, M., Comai, S., Matera, M.: Designing Data-Intensive Web Applications. Morgan Kaufmann, San Francisco (2003)Google Scholar
  5. 5.
    Conallen, J.: Building Web Applications with UML. Addison-Wesley, Boston (2003)Google Scholar
  6. 6.
    Dershowitz, N.: Termination of rewriting. J. Symb. Comput. 3(1/2), 69–116 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    De Troyer, O., Leune, C.: WSDM: a user-centered design method for web sites. In: Computer Networks and ISDN Systems–Proceedings of the 7th International WWW Conference, pp. 85–94. Elsevier, Amsterdam (1998)Google Scholar
  8. 8.
    Draheim, D., Weber, G.: Form-Oriented Analysis—A New Methodology to Model Form-Based Applications. Springer, New York (2004)Google Scholar
  9. 9.
    Gurevich, J.: Sequential abstract state machines capture sequential algorithms. ACM Trans. Comput. Log. 1(1), 77–111 (2000)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Houben, G.-J., Barna, P., Frasincar, F., Vdovjak, R.: HERA: development of semantic web information systems. In: Third International Conference on Web Engineering—ICWE 2003, LNCS, vol. 2722, pp. 529–538. Springer, New York (2003)Google Scholar
  11. 11.
    Kleene, S.C.: Representation of events in nerve sets and finite automata. In: Shannon, McCarthy (eds.) Automata Studies, pp. 3–41. Princeton University Press, Princeton (1956)Google Scholar
  12. 12.
    Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra, pp. 263–297. Pergamon, Oxford (1970)Google Scholar
  13. 13.
    Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19(3), 427–443 (1997)CrossRefGoogle Scholar
  14. 14.
    Kozen, D.: On Hoare logic and Kleene algebra with tests. In: Logic in Computer Science, pp. 167–172. IEEE, Piscataway (1999)Google Scholar
  15. 15.
    Kozen, D., Smith, F.: Kleene algebra with tests: completeness and decidability. In: Computer Science Logic, pp. 244–259, Utrecht, 21–27 September 1996Google Scholar
  16. 16.
    Lowe, D., Henderson-Sellers, B., Gu, A.: Web extensions to UML: using the MVC triad. In: Spaccapietra, S., March, S.T., Kambayashi, Y. (eds.) Conceptual Modeling—ER 2002, LNCS, vol. 2503, pp. 105–119. Springer, New York (2002)Google Scholar
  17. 17.
    Mayr, H.C., Schewe, K.-D., Thalheim, B., Welzer, T.: Integration of bargaining into e-business systems. Informatica 30(3), 335–345 (2006)zbMATHMathSciNetGoogle Scholar
  18. 18.
    Ragone, A., Straccia, U., Di Noia, T., Di Sciascio, E., Donini, F.M.: Towards a fuzzy logic for automated multi-issue negotiation. In: Hartmann, S., Kern-Isberner, G. (eds.) Foundations of Information and Knowledge Systems (FoIKS 2008), LNCS, vol. 4932, pp. 381–396. Springer, New York (2008)CrossRefGoogle Scholar
  19. 19.
    Schewe, K.-D.: The power of media types. In: Zhou, X., et al. (eds.) Web Information Systems—WISE 2004, LNCS, vol. 3306, pp. 53–58. Springer, New York (2004)Google Scholar
  20. 20.
    Schewe, K.-D., Thalheim, B.: Reasoning about web information systems using story algebras. In: Benczúr, A., Demetrovics, J., Gottlob, G. (eds.) Advances in Databases and Information Systems (ADBIS 2004), LNCS, vol. 3255, pp. 54–66. Springer, New York (2004)Google Scholar
  21. 21.
    Schewe, K.-D., Thalheim, B.: An algorithmic approach to high-level personalisation of web information systems. In: Fan, W., Wu, Z. Yang, J. (eds.) Web Age Information Management - WAIM 2005, LNCS, vol. 3739, pp. 737–742. Springer, New York (2005)CrossRefGoogle Scholar
  22. 22.
    Schewe, K.-D., Thalheim, B.: Conceptual modelling of web information systems. Data Knowl. Eng. 54(2), 147–188 (2005)CrossRefGoogle Scholar
  23. 23.
    Schewe, K.-D., Thalheim, B.: Personalisation of web information systems—a term rewriting approach. Data Knowl. Eng. 62(1), 101–117 (2007)CrossRefGoogle Scholar
  24. 24.
    Schewe, K.-D., Thalheim, B.: Term rewriting for web information systems—termination and Church Rosser property. In: Benatallah, B., et al. (eds.) Web Information Systems Engineering—WISE 2007, LNCS, vol. 4831, pp. 261–272. Springer, New York (2007)CrossRefGoogle Scholar
  25. 25.
    Thalheim, B.: Entity-Relationship Modeling—Foundations of Database Technology. Springer, New York (2000)zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Klaus-Dieter Schewe
    • 1
  • Bernhard Thalheim
    • 2
  • Qing Wang
    • 1
  1. 1.Information Science Research CentrePalmerston NorthNew Zealand
  2. 2.Department of Computer ScienceChristian Albrechts University KielKielGermany

Personalised recommendations