An algorithmic approach to high-level personalisation of web information systems

Authors:
Klaus-Dieter Schewe;Bernhard Thalheim
Affiliations:
Information Science Research Centre, Massey University, Palmerston North, New Zealand;Department of Computer Science, Christian Albrechts University Kiel, Kiel, Germany
Venue:
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Year:
2005

Citing 7
Cited 3

Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
WSDM: a user centered design method for Web sites

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Designing Data-Intensive Web Applications

Designing Data-Intensive Web Applications
Kleene Algebra with Tests: Completeness and Decidability

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
On the complexity of reasoning in Kleene algebra

Information and Computation - Special issue: LICS'97
Conceptual modelling of web information systems

Data & Knowledge Engineering
Hera: development of semantic web information systems

ICWE'03 Proceedings of the 2003 international conference on Web engineering

Personalisation of web information systems - A term rewriting approach

Data & Knowledge Engineering
Customising Web Information Systems According to User Preferences

World Wide Web
Term rewriting for web information systems: termination and church-rosser property

WISE'07 Proceedings of the 8th international conference on Web information systems engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A web information system (WIS) can be described by abstract locations and transitions between them that are enabled by user actions. This leads to Kleene algebras with tests, thus can be subject to reasoning with equations. In particular, this can be applied to personalisation according to the preferences and goals of users. In this paper we first study decidability and complexity of this reasoning process, then present a Knuth-Bendix-type algorithmic solution for the problem.