The Experts below are selected from a list of 249 Experts worldwide ranked by ideXlab platform
Klausdieter Schewe - One of the best experts on this subject based on the ideXlab platform.
-
Semantics and Inferences on Storyboarding
Design and Development of Web Information Systems, 2019Co-Authors: Klausdieter Schewe, Bernhard ThalheimAbstract:The chapter continues the presentation of the storyboarding method from Chapter 3 emphasising content for further, advanced reading. The main focus of the chapter is on the customisation of the storyboard to preferences, goals and deontic constraints. For this a formalisation of plots on grounds of Kleene algebras with test is used, which is then exploited for customisation using a conditional term rewriting approach. A formal proof of the Church-Rosser Property of this rewriting approach is conducted. This is extended to capture the effects of deontic constraints and their compatibility with preferences.
-
Customising Web Information Systems According to User Preferences
World Wide Web, 2009Co-Authors: Klausdieter Schewe, Bernhard Thalheim, Qing WangAbstract: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.
-
term rewriting for web information systems termination and church Rosser Property
Web Information Systems Engineering, 2007Co-Authors: Klausdieter Schewe, Bernhard ThalheimAbstract: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.
-
WISE - Term rewriting for web information systems: termination and church-Rosser Property
Web Information Systems Engineering – WISE 2007, 1Co-Authors: Klausdieter Schewe, Bernhard ThalheimAbstract: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.
Bernhard Thalheim - One of the best experts on this subject based on the ideXlab platform.
-
Semantics and Inferences on Storyboarding
Design and Development of Web Information Systems, 2019Co-Authors: Klausdieter Schewe, Bernhard ThalheimAbstract:The chapter continues the presentation of the storyboarding method from Chapter 3 emphasising content for further, advanced reading. The main focus of the chapter is on the customisation of the storyboard to preferences, goals and deontic constraints. For this a formalisation of plots on grounds of Kleene algebras with test is used, which is then exploited for customisation using a conditional term rewriting approach. A formal proof of the Church-Rosser Property of this rewriting approach is conducted. This is extended to capture the effects of deontic constraints and their compatibility with preferences.
-
Customising Web Information Systems According to User Preferences
World Wide Web, 2009Co-Authors: Klausdieter Schewe, Bernhard Thalheim, Qing WangAbstract: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.
-
term rewriting for web information systems termination and church Rosser Property
Web Information Systems Engineering, 2007Co-Authors: Klausdieter Schewe, Bernhard ThalheimAbstract: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.
-
WISE - Term rewriting for web information systems: termination and church-Rosser Property
Web Information Systems Engineering – WISE 2007, 1Co-Authors: Klausdieter Schewe, Bernhard ThalheimAbstract: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.
Vladimir A. Oleshchuk - One of the best experts on this subject based on the ideXlab platform.
-
COCOON - On Public-Key Cryptosystem Based on Church-Rosser String-Rewriting Systems (Extended Abstract)
Lecture Notes in Computer Science, 1995Co-Authors: Vladimir A. OleshchukAbstract:We propose an approach toward public-key cryptosystems based on finite string-rewriting systems with Church-Rosser Property. The approach utilizes an existence of unique normal form for any congruence class modulo such a system and possibility to find it in linear time. Such cryptosystems can be used in the case we are dealing with a large network of communicating parties when it is impractical to use a distinct secret method signing for every pair users and we would like to have a unified secret method for all senders sending to a receiver.
Alejandro Rios - One of the best experts on this subject based on the ideXlab platform.
-
the λ calculus with constructors syntax confluence and separation
Journal of Functional Programming, 2009Co-Authors: Ariel Arbiser, Alexandre Miquel, Alejandro RiosAbstract:We present an extension of the λ(η)-calculus with a case construct that propagates through functions like a head linear substitution, and show that this construction permits to recover the expressiveness of ML-style pattern matching. We then prove that this system enjoys the Church–Rosser Property using a semi-automatic ‘divide and conquer’ technique by which we determine all the pairs of commuting subsystems of the formalism (considering all the possible combinations of the nine primitive reduction rules). Finally, we prove a separation theorem similar to Bohm's theorem for the whole formalism.
-
The lambda-calculus with constructors: Syntax, confluence and separation
Journal of Functional Programming, 2009Co-Authors: Ariel Arbiser, Alexandre Miquel, Alejandro RiosAbstract:We present an extension of the lambda(eta)-calculus with a case construct that propagates through functions like a head linear substitution, and show that this construction permits to recover the expressiveness of ML-style pattern matching. We then prove that this system enjoys the Church-Rosser Property using a semi-automatic 'divide and conquer' technique by which we determine all the pairs of commuting subsystems of the formalism (considering all the possible combinations of the nine primitive reduction rules). Finally, we prove a separation theorem similar to Böhm's theorem for the whole formalism.
-
A lambda-calculus with constructors
2006Co-Authors: Ariel Arbiser, Alexandre Miquel, Alejandro RiosAbstract:We present an extension of the lambda(eta)-calculus with a case construct that propagates through functions like a head linear substitution, and show that this construction permits to recover the expressiveness of ML-style pattern matching. We then prove that this system enjoys the Church-Rosser Property using a semi-automatic `divide and conquer' technique by which we determine all the pairs of commuting subsystems of the formalism (considering all the possible combinations of the nine primitive reduction rules). Finally, we prove a separation theorem similar to Böhm's theorem for the whole formalism.
-
a lambda calculus with constructors
Lecture Notes in Computer Science, 2006Co-Authors: Ariel Arbiser, Alexandre Miquel, Alejandro RiosAbstract:We present an extension of the λ(η)-calculus with a case construct that propagates through functions like a head linear substitution, and show that this construction permits to recover the expressiveness of ML-style pattern matching. We then prove that this system enjoys the Church-Rosser Property using a semi-automatic 'divide and conquer' technique by which we determine all the pairs of commuting subsystems of the formalism (considering all the possible combinations of the nine primitive reduction rules). Finally, we prove a separation theorem similar to Bohm's theorem for the whole formalism.
-
RTA - A lambda-calculus with constructors
Lecture Notes in Computer Science, 2006Co-Authors: Ariel Arbiser, Alexandre Miquel, Alejandro RiosAbstract:We present an extension of the λ(η)-calculus with a case construct that propagates through functions like a head linear substitution, and show that this construction permits to recover the expressiveness of ML-style pattern matching. We then prove that this system enjoys the Church-Rosser Property using a semi-automatic ‘divide and conquer' technique by which we determine all the pairs of commuting subsystems of the formalism (considering all the possible combinations of the nine primitive reduction rules). Finally, we prove a separation theorem similar to Bohm's theorem for the whole formalism.
Qing Wang - One of the best experts on this subject based on the ideXlab platform.
-
Customising Web Information Systems According to User Preferences
World Wide Web, 2009Co-Authors: Klausdieter Schewe, Bernhard Thalheim, Qing WangAbstract: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.
