{'fraction_non_alphanumeric': 0.01904036557501904, 'fraction_numerical': 0.0, 'mean_word_length': 4.802650957290132, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
PROPOSAL of A LOGICAL MODEL ADAPTATION FOR ADAPTIVE EDUCATIONAL HYPERMEDIA SYSTEMS

We present in this paper a logical adaptation model. A model of adaptation must be able to take into consideration the different dynamic aspects of adaptive hypermedia. Such a model is in particular to represent the situation in which the user is located, the way their profile is updated and coping techniques to apply. This model consists of two components: a version of situational logic and rule language. Our adaptation model is based on the calculation of first-order predicate. This solution has several advantages. It is declarative and thus more natural to implement the programmatic approaches and less tied to a particular implementation. It is possible to reason about the model, since it is based on logic. This model consists of two components: a version of the situational logic and rule language. Situational logic, which can represent declaratively situations and how they change based on your actions, provides a basis to represent different aspects of adaptation: representation of the situation in which the user is located, taking into account the changing profile of the latter possibility to perform certain actions. We describe in this article the version of the situational logic that we have chosen for adaptive hypermedia. This logic uses a rule language that we have developed specifically for adaptive hypermedia. This rule language is based on the basic rules and meta- rules. The basic rules are used to describe how to navigate the area, based on the relationships between the various components of the latter. Meta-rules are used to describe what coping strategy, that is to say which set of rules should be selected for a given user. As we will see in this article, this rule-based system using meta-rules can simplify the writing of the rules with respect to existing systems, and can take into account the different types of data at different levels of the model adaptation. We also propose a formal deduction system for describing how to think about the rules of our language. With this deduction system, it is possible to reason about how the rules are taken into account. II. Problematic In this section, we present the problems of the current models, and that our model seeks to answer. We present first the problems related to the adaptation of models in general, and in particular the rule language. A. Model of adaptation In current systems, adaptation is most often modeled by rules. How these rules are taken into account by the system, the way we reason about its rules and principles underlying adaptation are not explicit. The way the rules involved in the adaptation and how the state of the system is modeled processes are not formally modeled. These aspects are often dependent on a system implementation. They cannot be modified if necessary to take into consideration other forms of accommodation as originally planned, for example. Moreover it is not possible to reason about such systems. To address this problem, we propose a model that explicitly takes into consideration the different aspects of adaptation, regardless of the implementation that is made. Based on the predicate calculus of the first order, it is possible to reason on this model. B. Rule's language The existing rule languages are often based on a single type of rules for describing adaptation. These rules take into account the domain, the user profile and domain knowledge. Syntactically, these elements are found in the premises of the rules. To describe non-trivial adaptation mechanisms, it is necessary to involve numerous assumptions, containing elements of different natures. The solutions implemented in current systems are unsatisfactory. Moreover, there is no deduction formalisms describing how to interpret the rules, and to change it if necessary. To solve this problem we propose a rule language, using meta-rules.