TY - JOUR
T1 - Customising web information systems according to user preferences
AU - Schewe, Klaus Dieter
AU - Thalheim, Bernhard
AU - Wang, Qing
PY - 2009/3
Y1 - 2009/3
N2 - 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.
AB - 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.
KW - Church-Rosser property
KW - Critical pair completion
KW - Deontic constraint
KW - Kleene algebra with tests
KW - Media type
KW - Personalisation
KW - Preference rule
KW - Term rewriting
KW - Termination
KW - Web information system
UR - http://www.scopus.com/inward/record.url?scp=59349095734&partnerID=8YFLogxK
U2 - 10.1007/s11280-008-0055-z
DO - 10.1007/s11280-008-0055-z
M3 - Article
SN - 1386-145X
VL - 12
SP - 27
EP - 50
JO - World Wide Web
JF - World Wide Web
IS - 1
ER -