Abstract
The use of conditional term rewriting on the basis of Kleene algebras with tests is investigated as an approach to high-level personalisation of Web Information Systems. The focus is on the possible action sequences that can be represented by an algebraic expression called plot. 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, the approach further proposes critical pair completion to be used in order to enforce the desirable Church-Rosser property.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Binemann-Zdanowicz, A., Thalheim, B.: Modeling information services on the basis of ASM semantics. In: Börger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol. 2589, pp. 408–410. Springer, Heidelberg (2003)
Blass, A., Gurevich, J.: Abstract state machines capture parallel algorithms. ACM Transactions on Computational Logic 4(4), 578–651 (2003)
Börger, E., Stärk, R.: Abstract State Machines. Springer, Heidelberg (2003)
Börger, E., Stärk, R., Schmid, J.: Java and the Java Virtual Machine: Definition, Verification and Validation. Springer, Heidelberg (2001)
Dershowitz, N.: Termination of rewriting. Journal of Symbolic Computation 3(1/2), 69–116 (1987)
Gurevich, J.: Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)
Gurevich, J., Sopokar, N., Wallace, C.: Formalizing database recovery. Journal of Universal Computer Science 3(4), 320–340 (1997)
Kleene, S.C.: Representation of events in nerve sets and finite automata. In: Shannon, McCarthy (eds.) Automata Studies, pp. 3–41. Princeton University Press (1956)
Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press, Oxford, UK (1970)
Kozen, D.: Kleene algebra with tests. ACM Transactions on Programming Languages and Systems 19(3), 427–443 (1997)
Kozen, D.: On Hoare logic and Kleene algebra with tests. In: Logic in Computer Science, pp. 167–172 (1999)
Prinz, A., Thalheim, B.: Operational semantics of transactions. In: Schewe, K.-D., Zhou, X. (eds.) Database Technologies 2003: Fourteenth Australasian Database Conference. Conferences in Research and Practice of Information Technology, vol. 17, pp. 169–179 (2003)
Schewe, K.-D., Thalheim, B.: Reasoning about web information systems using story algebras. In: Benczúr, A.A., Demetrovics, J., Gottlob, G. (eds.) ADBIS 2004. LNCS, vol. 3255, Springer, Heidelberg (2004)
Schewe, K.-D., Thalheim, B.: An algorithmic approach to high-level personalisation of web information systems. In: Fan, W., Wu, Z., Yang, J. (eds.) WAIM 2005. LNCS, vol. 3739, pp. 737–742. Springer, Heidelberg (2005)
Schewe, K.-D., Thalheim, B.: Conceptual modelling of web information systems. Data and Knowledge Engineering 54(2), 147–188 (2005)
Schewe, K.-D., Thalheim, B.: Personalisation of web information systems - a term rewriting approach. Data and Knowledge Engineering 62(1), 101–117 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schewe, KD., Thalheim, B. (2007). Term Rewriting for Web Information Systems – Termination and Church-Rosser Property. In: Benatallah, B., Casati, F., Georgakopoulos, D., Bartolini, C., Sadiq, W., Godart, C. (eds) Web Information Systems Engineering – WISE 2007. WISE 2007. Lecture Notes in Computer Science, vol 4831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76993-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-76993-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76992-7
Online ISBN: 978-3-540-76993-4
eBook Packages: Computer ScienceComputer Science (R0)