<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>ExPLoRAA: An Intelligent Tutoring System for Active Ageing in (Flexible) Time and Space?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Amedeo Cesta</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gabriella Cortellessa</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Riccardo De Benedictis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Francesca Fracasso</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>CNR - Italian National Research Council, ISTC</institution>
          ,
          <addr-line>Rome</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The \Citta Educante" project aims at radically rethinking the learning experience through advanced ICT technology to enrich and innovate didactic methods and tools. Among the project results, ExPLoRAA is an Intelligent Tutoring System, speci cally tailored for senior citizens, which, by integrating arti cial intelligence and state-of-the-art ICT techniques, is able to support older adults during visits to cultural locations in a city. In particular, ExPLoRAA integrates both the users' psycho-physiological aspects as well as geo-localization information and temporal constraints in the attempt to personalize the learning stimuli during the visit while favouring the concept of active ageing for the older people. After a generic introduction to the \Citta Educante" project, this paper presents both ExPLoRAA as a whole and some of the underlying solutions. Speci cally, the paper shows some of the choices that have been made to solve problems related to temporal exibility, supporting the dynamic adaptation of stimuli over time while ensuring the possibility for the users to further adapt a visit according to their current feelings. The paper describes both the choices made in the current system prototype and its embodiment in a concrete scenario which, by implementing a game similar to \treasure hunt", aims at fostering the physical and cognitive activity of the participating older people.</p>
      </abstract>
      <kwd-group>
        <kwd>Intelligent Tutoring System Flexibility</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The \Citta Educante" project1 (the name means \city that educates" in
Italian) aims at proposing new educational approaches, enriching and innovating
methods and tools, overcoming the classical systems and the traditional role of
educators. An Intelligent Tutoring System (ITS) [
        <xref ref-type="bibr" rid="ref15 ref18">15, 18</xref>
        ] is a computer system
that, thanks to personalized stimuli to the learners, enables learning in an
effective and meaningful manner. Such systems aim at radically rethinking the
learning environment through the application of the most advanced ICT
technology and represent, hence, a valid contribution to the project.
      </p>
      <p>
        Common ITSs, typically, aim at replicating the bene ts of one-to-one
personalized tutoring in contexts where students would have access to one-to-many
instruction from a single teacher (e.g., classroom lectures), or no teacher at
all (e.g., on-line homework) [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Such systems are typically related to classical
learning environment, hence neglecting the possibility to act in time (e.g.,
lifelong) and space (e.g., at school, in an outdoor environment, during leisure, etc.),
thus overcoming the classical systems and the traditional \lessons".
      </p>
      <p>Through the \Citta Educante" project, the theme of learning is framed in
relation to the response to social challenges linked to the renewal of the educational
system, to be achieved by means of the implementation of new learning/teaching
models and/or the optimization of the existing ones on the various areas of life
and knowledge, as well as new systems/evaluation processes, in which the
technology (platforms and web) becomes an enabling factor.</p>
      <p>
        Speci cally, the authors' goal in the project has been the one of thinking
an incarnation of the \Citta Educante" for the continuous education of older
people. In particular, considering the more recent experiences in the interaction
of elderlies with complex machines [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], keeping in mind previous experience in
training elders [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and crisis managers [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], we have built a new learning
environment, called ExPLoRAA (for ExPeriential LeaRning for Active Aging), aimed
at improving the active aging and the participation in the social life of the elders
living at home, in the community, and at work.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Televita: the Target Organization</title>
      <p>
        While pursuing the objective of the project, which aims at reformulating the
learning environments through the creation of platforms, services and ICT
applications, we got in touch with several volunteering organizations addressing,
speci cally, elderlies' needs. Among the di erent organizations, in particular,
Televita2 is a volunteering association whose main objective is to maintain the
elderlies active and motivated, leveraging upon individual aptitudes and/or
competencies [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Most of the Televita's volunteers, in fact, are, themselves, elders
who want to keep active by o ering their abilities and competences to the
organization. Although Televita's main activity consists in providing tele-assistance
services (tele-friendship) and a 24h active helpline devoted to lonely elders who
need support, it also manages several laboratories that involve elders both as
attendees and \teachers". Examples include a computer lab, a tailoring lab, a
cooking lab and an Italian language teaching for foreign people. Furthermore,
the association organizes cultural events as concerts, museum visiting, theater,
etc.
      </p>
      <p>Among the o ered services, we focused in particular on two speci c activities
that were both in line with the \Citta Educante" concept and that are outlined
in Figure 1:
2 http://www.televita.org
{ The AttivaMente laboratory : aims at keeping elders mentally active, so as
to limit the cognitive decline associated with the advancement of age, by
proposing them cognitive stimuli. Such stimuli, mostly consisting in general
culture quiz and/or crosswords, are proposed to the elders in a context
similar to a school lesson. Speci cally, by relying on some previous knowledge
of the involved persons, as well as on their interactions during the lesson, a
teacher, a volunteer himself, yet with more experience than others, controls
the course's progress and slightly adapt it to the speci c context's needs.
Since the stimuli are predetermined, however, such adaptations tend to be
limited to the possibilities of the case. The use of arti cial intelligence
techniques, in this case, could support the personalized delivery of stimuli by
taking into account previous knowledge of the participants as well as their
interactions with the AI system increasing, compared to the classical case,
the personalization capabilities.
{ The Art History lessons and cultural events : analogously to the AttivaMente
case, before attending to cultural events, some of the participants,
according to their abilities and competencies, are asked to nd information about
some speci c aspects of the event (e.g., a particular work of art within a
museum, relevant historical happenings related to a visited site, etc.). Such
information are then shared, in a \sort of" lesson with other participants in
a classroom context and also outside during the event, enriching the overall
knowledge of the group while encouraging the interaction among the
members. Similarly to the AttivaMente case, such information may result to be
limited and/or not customized to the speci c members of the event. AI
techniques, in this case, might o er the opportunity to enrich the cultural events
experience by providing further personalized stimuli to the event
participants, as well as interaction requests to test the level of engagement and
actively stimulate them.</p>
      <p>Combining the above activities represents an opportunity for the elders to keep
themselves active while learning in time and space. Additionally, the use of AI
can support the development of more e ective and engaging learning experience.</p>
    </sec>
    <sec id="sec-3">
      <title>The ExPLoRAA Intelligent Tutoring System</title>
      <p>
        The idea of developing the ExPLoRAA system is born as a consequence of a
eld experience. Speci cally, by taking inspiration from a previous work [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], in
which students were trained for managing crisis, the approach used within
ExPLoRAA is based on the idea of dynamically composing lessons through the use
of automated planning [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. In particular, starting from a static representation
containing an high-level lesson track, initially stored in a database, the lesson is
planned and dynamically adapted and personalized to the involved users. The
idea of using the technology related to automated planning comes from the need
to create a su ciently extensive didactic experience to reproduce a large
number of di erent situations which are, at the same time, characterized by a high
variability of stimuli, aimed at increasing the involvement level of users.
Automated planning, indeed, favors the generation of di erent lessons that would be
too complicated to obtain with a simple pre-compilation of stories. The
timelinebased approach to automated planning [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], in particular, represents the unifying
element of the various modules by ensuring the dynamic adaptability of plans
by promoting experiential learning.
      </p>
      <p>From a high-level point of view, the main modules of the system are
described in Figure 2. In particular, it is possible to distinguish between two kinds
of involved users: the students, i.e., a group of people, potentially, of any age,
interested in using the learning services o ered by the ExPLoRAA environment,
and the teachers, i.e., users with special privileges who have the opportunity to
observe students, monitor the progress of the lessons and of the overall learning
environment. The above users interact with the ExPLoRAA system which is
composed of three functional blocks, intended as architectural subsystems,
implementing the corresponding high-level functionalities: (i) the user modeling, whose
goal is to create and maintain a user model and provide guidance for improving
the learning process; (ii) the lesson modeling, whose role consists in combining
the information from the previous subsystem and to create the customized lesson
as well as to control its evolution; (iii) the lesson presentation, whose purpose
is to represent the lesson through e ective graphical interfaces. Additionally, it
is worth highlighting that the proposed system provides users, whether students
or teachers, the opportunity to adapt the learning environment's evolution in
real time by interpreting their decisions. In fact, the architecture is based on a
sense-plan-act paradigm implementing, in a continuous loop, the three
primitives (a) sense, in which information is collected from questions and sensors, (b)
plan where a lesson blueprint is created, using the information available, and (c)
act, in which the action, chosen by the planning process, is actually executed.</p>
      <p>
        It is worth highlighting that, by exploiting mobile technology, the lesson
presentation module interacts remotely with the system allowing di erent learning
modalities: (a) on-site learning, closer to the classical teaching, in which the
technology is used as a support to the teaching in a classroom, with the aim
to create richer lessons, and (b) distributed learning, in which the technology
aims to support lessons outside the classroom during a practical experience.
More speci cally, in the on-site training modality, the system can be used by
a group of students at the same time. This mode represents an extension to
the classical learning method in which a teacher teaches to a group of students.
In this case, however, compared to the classical approach, the teaching is
enhanced by the introduction, within the lesson, of the ExPLoRAA technology.
Each lesson is instantiated by the teacher by de ning speci c learning objectives
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] that we call goals. The system processes the lesson and presents, at proper
time, the information to the students through the presentation tools. Students
interact directly with the system, providing their answers to certain
circumstances proposed by the system, and transmitting data from sensors available
on the adopted devices (e.g., physiological parameters) enriching the users'
models. Conversely, in the distributed training case, the lesson does not happen in
a single physical room and is distributed among the students who are remotely
connected to the system. The lesson is still instantiated by the teacher de ning
the speci c learning objectives but may have variable, potentially in nite,
duration. This kind of approach, compared to the previous one, is more innovative.
Students interact directly with the system while on the move within the city,
providing their answers to certain proactive stimuli proposed by the system as
well as constantly transmitting data from the sensors available on the chosen
devices (e.g., geographic location, physiological parameters, etc.). Sensor data,
in particular, enriches the users' models which, in turn, adapt the lesson to the
students resulting in a highly personalized learning experience.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Timeline-based planning to support dynamic lessons</title>
      <p>Since most of the components of the ExPLoRAA system strongly depend on
temporal aspects, we have chosen to rely on a speci c automated planning
technique, called timeline-based, which allows to explicitly reason on time.
Timelinebased planning, indeed, allows to reason about events in time and, hence,
represents a valid tool for meeting our pedagogical needs. Planning a lesson, in
particular, requires dispatching information at proper time. Additionally,
reacting to users' interactions requires plan adaptation capabilities which can more
hardly be achieved through other automatic planning techniques. Furthermore,
the dynamic adaptation of the user pro les, which can take place on the di erent
features that represent the user's model, can also be achieved through timelines.</p>
      <p>As already said, timeline-based planning constitutes a technology that easily
allows us to solve our problems. In order to better contextualize the choices that
we have made and to better explain the di erent components of the system,
however, it is worth introducing some basic formalism about constraint networks,
on which timeline-based planning search strongly relies, and about the main
concepts related to timeline-based planning. Speci cally, the main ingredients of
constraint networks are variables and constraints.</p>
      <p>De nition 1. A variable is an object that has a name and is able to take
different values.</p>
      <p>A variable (whose name is) x must be given a value from a set that is called
the domain of x and is denoted by dom (x). The domain of a variable x may
evolve in time but is always included in a set called initial domain. Depending on
the nature of these domains, variables can be distinguished between continuous,
having an in nite initial domain usually de ned in terms of real intervals, and
discrete, whose initial domain contains a nite number of values.
De nition 2. A constraint is a restriction on combinations of values that can
be taken simultaneously by a set of variables.</p>
      <p>A constraint c is de ned over a set of variables which constitute the scope
of c and are denoted by scp (c). Finally, a structure composed of variables and
constraints is called a constraint network.</p>
      <p>De nition 3. A constraint network N is composed of a nite set of variables,
denoted by vars (N ), and a nite set of constraints, denoted by cons (N ), such
that 8c 2 cons (N ) ; scp (c) vars (N ).</p>
      <p>
        Since constraint networks are fundamentals for timeline-based planning, it
is worth introducing some further concepts without going into too much formal
details. Speci cally, an assignment of values to some or all the variables is called
an evaluation. Furthermore, an evaluation is said to be consistent if it does not
violate any constraint. An evaluation is said to be complete if it includes all the
variables. Finally, given a constraint network, the problem of nding a consistent
and complete evaluation is called Constraint Satisfaction Problem (CSP) (refer
to [
        <xref ref-type="bibr" rid="ref13 ref9">9, 13</xref>
        ] for a comprehensive introduction to CSPs).
      </p>
      <p>As regards timeline-based planning, the main data structure is the timeline
which, in generic terms, is a function of time over a nite domain. Values on the
timelines are extracted from a set of temporally scoped predicates (i.e., predicates
endowed with extra arguments belonging to the Time domain T, either real or
discrete), with their parameters, called tokens. Formally,
De nition 4. A token is an expression of the form:
where n is a predicate name, x0; : : : ; xk are the predicate's parameters (i.e.,
constants, numeric variables or object variables), s and e are temporal parameters
belonging to T such that s e and is a parameter (i.e., a constant or an object
variable) representing the timeline on which the token apply.</p>
      <p>The overall idea pursued in ExPLoRAA consists in using such tokens for
representing the planned stimuli. Compared to the general formalization above,
however, we can a ord some simpli cations. Speci cally, since the stimuli have no
duration, the s and e variables of each token would always be equal. We address
this by removing one of the two variables, e.g., the e variable. Additionally, since
all the tokens will apply on a single \lesson" timeline, the variable would be a
constant. For example, an expression st0 () @[10 : 00] would represent a stimulus
st0 which is planned to happen at time 10:00.</p>
      <p>
        It is worth noticing that the tokens' parameters, including the temporal ones,
are constituted, in general, by the variables of the constraint network as
introduced in the De nition 1. In order to reduce the allowed values for such
parameters, and thus decreasing the system's allowed behaviors, it is possible,
indeed, to impose constraints, as introduced in the De nition 2, among them
(and/or between the parameters and other possible variables). Such constraints
include temporal constraints, usually expressed by means of interval relations [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ],
binding constraints between object variables as well as linear constraints among
numerical, including the temporal one, variables.
      </p>
      <p>The set of tokens and constraints is used to describe the main data structure
that will be used to represent the nodes of the timeline-based search space: the
token network.</p>
      <sec id="sec-4-1">
        <title>De nition 5. A token network is a tuple</title>
        <p>= (T ; C), where:
{ T = ft0; : : : ; tkg is a set of tokens.
{ C is a set of constraints, required to be consistent, on the variables of the
tokens in T .</p>
        <p>Additionally, tokens can be partitioned into two groups: facts and goals.
While facts are, by de nition, inherently true, goals have to be achieved.
Specifically, causality, in the timeline-based approach, is de ned by means of a set o
rules indicating how to achieve goals. Formally,
De nition 6. A rule is an expression of the form
r
where:
{ n (x0; : : : ; xk) @ [s; e; ] is the head of the rule, i.e., an expression in which
n is a predicate name, x0; : : : ; xk are constants, numeric variables or object
variables, s and e are temporal variables belonging to T such that s e and
is an object variable representing the timeline on which the token apply.
{ r is the body of the rule (or the requirement), i.e., either a slave token, a
constraint among tokens (possibly including the x0 : : : xk variables), a
conjunction of requirements or a disjunction of requirements.</p>
        <p>Rules de ne causal relations that must be complied to in order for a given goal to
be achieved. For each goal having the form of the head of a rule, the body of the
rule must also be present in the token network. As an example, the expression
fst0 () @[s] fst1 () @[s1] ^ 10 s s1 20gg represents a rule asserting that,
for each stimulus st0 there must exist, from 10 to 20 seconds before, a stimulus
st1.</p>
        <p>We have now all the ingredients to de ne a timeline-based planning problem.
In particular, the de nition can rely on the above concept of requirement.
De nition 7. A timeline-based planning problem is a triple P = (T ; R; r),
where:
{ T is a set of timelines.
{ R is a set of rules.
{ r is a requirement, i.e., either a (fact or goal) token, a constraint among
tokens, a conjunction of requirements or a disjunction of requirements.</p>
        <p>
          The role of a timeline-based solver consists, basically, in applying the proper
rules to achieve all the goals of the problem while maintaining the constraint
network consistent. It is worth highlighting that, in general, the application
of the rules might result in the introduction of further goals into the token
network. Such goals, also called sub-goals, require to be achieved as well. The
process ends up when, for all the goals of the token network, either the body
of its corresponding rule is present in the token network or it is recognized as
semantically equivalent to another token (in this case we talk about uni cation
of the tokens). Notice that, despite the simplicity of the above solving procedure,
the combination of disjunctions and constraints in the rules make the resolution
process, in generally, extremely challenging from a computational point of view.
For this reason, indeed, heuristics are often used to make the resolution process
more e cient (see, for example, [
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ]).
5
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Modeling Students and Lessons through Timelines</title>
      <p>As already mentioned, the ExPLoRAA system is composed of di erent
functional blocks. In particular, the user modeling module aims at creating and
dynamically maintaining an updated model of the users which is used as a starting
point for the personalization of the lessons. By pursuing the overall objective of
enhancing the learning experience, indeed, it is necessary to keep a user model
up-to-date in order to consider how their emotional, psychological, physiological
and geographical parameters can in uence the learning process. Speci cally, the
student modeling has three main objectives:
{ Model and monitor relevant factors through which the lesson can be
customized;
{ Develop a model that can represent the user's pro le;
{ Provide a high level guidance for customizing learning objectives.</p>
      <p>The set of considered relevant factors include, among the other things, the
health status, the fatigue, the personal interests, the level of engagement and
the current performance assessment. The use of Bluetooth bracelets (e.g., the
Empatica E43), for example, allows the extraction of physiological values such as
peripheral skin temperature, skin conductance, heart rate and heart variability.
Additionally, it is possible to leverage on geo-localization services to get a good
estimate of the users' position in time. The initial evaluation of these variables,
used as a baseline to initialize the didactic experience and as a reference point
for subsequent measurements, can be done through the use of standardized
questionnaires or physiological measurements performed o -line before the lesson. It
is worth to notice, however, that the pro le of a student can also be updated
exploiting the interactions of the users with the system asking them, for
example, to answer to sporadic questions. As an example, the users' engagement is
measured through a ve levels Likert-type scale which is administered to the
users at regular intervals. Finally, particular emphasis is given to the students'
performance which is monitored and observed through the administration of
questions and the interpretation of the provided answers.</p>
      <p>By processing the above information, the system generates a user model that
is constantly updated to perceive and represent signi cant changes in the
emotional state (note that parameters can generally change over time). In addition,
students' performance is analyzed and processed in order to gather further
usable information useful for a ner customization of the lesson. Furthermore, the
teacher can access this information in order to supervise and control the
customization. For this purpose, this component can provide guidance on how to
customize the lesson. Personalization of a training course can therefore be done
automatically, but it can also be suggested to a teacher who independently
decides whether to adapt the training course (i.e., according to a mixed-initiative
style).
5.1</p>
      <p>Modeling the Lessons
The modeling of the lessons is the key feature of the ExPLoRAA system since
it creates and manages the network of stimuli that guides the entire learning
session. Nodes on this network are tokens and are intended to represent
temporally annotated stimuli (e.g., videos, text messages, questions, etc.) to be sent,
3 https://www.empatica.com/research/e4
at appropriate time, to the users while edges represent causal and temporal
relations among such stimuli introduced either in the planning problem de nition or
through the application of the rules. Additionally, tokens are endowed with
additional information including a set of covered topics (e.g., \art", \architecture",
\religion", etc.) and some content dependent on the nature of the stimulus (e.g.,
a text for textual stimulus or a URL for a video stimulus). Speci cally, when a
user enrolls to a lesson, de nes which of the topics covered by the lesson are of
interest to her/him. When sending stimuli to the users, a ltering procedure will
guarantee the delivery of only those stimuli for which the user has declared an
interest.</p>
      <p>It is worth noting that although the above network is initialized in order
to represent an abstract blueprint of a lesson, it is afterwards customized and
dynamically adapted to the pro le of the involved user. Personalization, indeed,
takes place both in terms of users' interest in some topics, as explained earlier,
as well as in terms of the type (and the number) of tokens in the token network.
Speci cally, adaptations to the network are made thanks to the application of a
set of rules (introduced in De nition 6) associated to each lesson, which de ne
how to \react" to the users' pro le, to their updates and to their actions (e.g.,
moving to a speci c location or answering to a question). Such rules, in
particular, are intended to create the \conditions", in terms of events and their relations
within the network, for other events to be present. An example of rule can be \in
order to stimulate the cognitive activity of the group, either propose a simple
crosswords and the group's performance is low, or propose a complex crosswords
and the group's performance is high". Notice that by taking advantage of the
possibility of de ning disjunctions within the rules and being able to combine
such rules sequentially, it is possible to obtain a great wealth of possible lessons'
evolutions. Finally, since some of these rules may contain conditions which
concern the user model, not all of them are applicable (e.g., in the above example,
in case the group's current performance is low, only the simple crosswords is
proposed), resulting in an overall network which is always compatible with the
current users' pro les.</p>
      <p>Broadly speaking, the teacher loads the chosen lesson from a database
resulting in the construction of an initial token network corresponding to a set of
stimuli, positioned over time, which will be communicated to users like videos,
text messages, questions, etc. The network is, through the application of the
rules, afterwards customized to the users participating in the lessons. By
executing the lesson, then, tokens, representing stimuli and interaction requests, are
dispatched, at proper time, to the users interested to them. It is worth noticing
that in order to foster interaction and collaboration among them, the distributed
information may be partial, requiring users the need to send messages to other
students so that they can build an overview and respond appropriately to the
challenges posed by the system, thus fostering cooperation. Whenever the
prole of a user changes because, for example, her/his level of fatigue increases,
speci c rules are applied resulting in an update of the network so as to bring it
back to be \consistent" with the current status of the users. Similarly, updates
might happen as a consequence of users' actions, resulting in a network which
is always representative of the initial lesson while being dynamically adapted to
the speci c context.</p>
      <p>As an example, Figure 3 shows, at its top, an initial network containing three
stimuli (i.e., st0, st1 and st3) and an interaction request (i.e., ir2) representing,
for example, a question. Each event has its own execution time and its covered
topics (e.g., st0 will be dispatched at 08:20). In the gure, the arrows represent
the causal relations among the tokens that emerge from the application of the
rules. In other words, the st1 token is in the network \because of" the st0 goal.
Additionally, the st1 token is constrained to be from 15 to 40 seconds before the
st0 goal. Notice that in order to simplify the explanation and make the speech
clearer we have omitted the information regarding the other temporal constraints
which, however, can be considered embedded within the arrows.</p>
      <p>At 08:05, the interaction request ir2 requires the interested users (i.e., those
whose interests match the topics of the stimulus associated to the ir2 token) to
take some action (i.e., either a0 or a1). Suppose, as an example, that the action
a0 is chosen, the network is adapted to the one on the left by adding the new
token st4 at 08:30. Again, the st4 token is added within the network \because
of" the a0 action. Conversely, in case action a1 is chosen, the network is adapted
to the one on the right by adding the new tokens st5, at time 08:35, and st6 at
08:38. As already mentioned, it is worth noticing that this type of adaptation
occurs in a similar way as a consequence of the actions carried out by the users
as well as for the dynamic changes that occur to their pro le, ensuring a discrete
availability of exibility and adaptation to the particular conditions that may
arise in the di erent lessons.</p>
    </sec>
    <sec id="sec-6">
      <title>Supporting Lesson Adaptation</title>
      <p>
        An interesting feature of the proposed system regards the possibility for
adapting the lessons thanks to the supported temporal exibility. In particular, the
constraint network introduced in De nition 3 manages temporal variables and
constraints through a Simple Temporal Network (STN) (see [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]). Speci cally,
each constraint between two temporal variables xi and xj is limited to taking the
form l xj xi u where l and u are two constants representing, respectively,
the lower and the upper bound on the amount of time that lasts between the
two time points xi and xj . The application of the rules during the resolution
procedure requires the dynamic introduction of further variables, for each of the
slave tokens, and additional constraints into the constraint network. For this
reason we use incremental algorithms (see, for example, [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]) which are able to
e ciently manage the propagation of such constraints. These algorithms are able
to maintain the temporal exibility of the involved variables, producing, for each
variable x, a couple of bounds [lx; ux] representing its lower and upper allowed
values. Dechter et al., in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], demonstrate that assigning to each variable x its
earliest possible time lx results in a consistent temporal network4.
      </p>
      <p>While in a standard lesson execution we would use these values to establish
the timing for dispatching the stimuli, problems arise when the teachers want
to control their position in time. Suppose, for example, we have an STN with
two variables x0 and x1, representing the time points of two tokens associated
to two stimuli st0 and st1. Additionally, the 10 x1 x0 20 constraint
imposes a temporal distance between them which goes from 10 to 20 time units
(although the system uses milliseconds, we maintain in the dissertation a generic
measurement unit for sake of simplicity). The initial bounds of the x0 variable
is [10; 30] while the initial bounds of the x1 variable is [20; 50]. Since the earliest
possible times represent a solution for such a constraint network, st0 and st1 are
going to be dispatched, respectively, at time 10 and at time 20. Suppose, for any
didactic reason, the teacher wants to delay the execution time of the stimulus
st0 of 15 time units, a temporal constraint would reduce the bounds of the x0
variable to [25; 30]. The propagation of the constraints would tighten the bound
of the x1 variable as well to, possibly (notice that other constraints might also
be involved), [35; 50], hence right-shifting the dispatching time of st1 at 35. At a
second step, however, the teacher recognizes she/he has moved the stimulus st1
too far and decides it is better to move it a little back. The lower bound for the
st1 stimulus, however, is now 35 and cannot be moved back through temporal
constraints without introducing an inconsistency in the constraint network.</p>
      <p>We can get around this problem by introducing, for each variable x, together
with its lower (i.e., lx) and upper (i.e., ux) bounds resulting from the propagation
of the temporal constraints, a third value dx representing its dispatching time,
whose allowed values are always maintained between the bounds of the variable
(i.e., the relation lx dx ux always holds). Whenever the user decides to
4 It is worth noticing that the same result holds also when choosing for each variable
their latest possible times.
change the position in time of a stimulus, however, only the dispatching times
are updated, without touching the bounds of any variable.</p>
      <p>In order to implement such a procedure we need, rst of all, for each
temporal variable x, a list of watching constraints watchs [x] (i.e., for each variable,
the list of constraint watching for the variable's updates). Speci cally, when a
new constraint c is introduced into the constraint network, c is added to the
watching lists watchs [xi] of each variable xi 2 scp (c) belonging to the scope
of c. Additionally, we need a propagation queue propq responsible for
maintaining the list of variables whose dispatching time has been updated. Whenever
the dispatching time of a variable is updated, the variable is enqueued into the
propagation queue.</p>
      <sec id="sec-6-1">
        <title>Algorithm 1 The overall propagation procedure</title>
        <p>procedure propagate
while propq 6= ; do
x propq:dequeue
for all c 2 watches [x] do c.propagate(x)</p>
        <p>The propagation procedure is described in the Algorithm 1. Speci cally, while
the propagation queue is not empty, a variable x is dequeued from the queue
and a propagation procedure is called for each constraint c in the watching list
associated to the variable x (i.e., for all the constraints having the variable x
in their scope). Additionally, for each temporal constraint c having the form
l xj xi u the propagation procedure is described in the Algorithm 2.
Speci cally, whenever the dispatching time of the xi (xj) variable is updated,
the propagation procedure checks whether the xj (xi) variable's dispatching time
needs to be updated as well. In case it needs, the xj (xi) variable's dispatching
time is updated and the xj (xi) variable is enqueued in the propq propagation
queue.</p>
        <p>The last aspect to be considered regards the initial introduction of the
variables within the propagation queue. There are basically two reasons which might
lead to this: either (a) a bound of a variable x is updated, within the STN
propagation procedure, in a way such that the expression lx dx ux is violated or
(b) a user manually updates the dispatching time of a variable x associated to a
stimulus. In the rst case, described in the Algorithm 3, the dispatching time is
updated so as to restore the validity of the lx dx ux relation and the
variable is enqueued in propq. The second case, described in the Algorithm 4, more
straightforwardly, directly updates the dispatching time and enqueues the
varible in propq. Notice that, after calling both the STN propagation procedure and
the set dspatching time procedure, the propagate procedure (Algorithm 1)
must be called in order to update the dispatching times of the related variables.</p>
        <p>Finally, it is worth noticing that none of the above procedures is supposed to
fail. The consistency checking of the constraint network, indeed, is still delegated
to the STN propagation procedure.</p>
        <p>Algorithm 2 The propagation procedure for the temporal constraint
Algorithm 3 The bound update procedure called by the STN propagation
procedure
procedure set bound(x; l; u)
lx l; ux u
if dx &lt; lx then
dx lx
propq propq [ fxg
else if dx &gt; ux then</p>
        <p>dx
dx
propq</p>
        <p>propq [ fxg
Algorithm 4 The dispatching time update procedure
procedure set dispatching time(x; d)
if dx 6= d then
dx d
propq</p>
        <p>propq [ fxg</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>The ExPLoRAA Prototype and Preliminary Evaluation</title>
      <p>By relying on the concept sketched in Figure 2, we have realized a rst
prototype of the ExPLoRAA ITS. In particular, several instances of the Desktop
and Mobile applications, depicted in Figure 4, allow students and teachers the
access to the ExPLoRAA system through the remote interaction with a
centralized back-end. Speci cally, teachers have the opportunity to create and manage
lessons while monitoring the students following them. Students, on the other
hand, enroll to the available lessons specifying their interests and receive
customized stimuli according to their psychophysiological state assessed through a
combination of sensors and targeted questions.</p>
      <p>Fig. 4. The ExPLoRAA Desktop and Mobile Graphical User Interfaces.</p>
      <p>We have created a lesson model example inspired by the \Madonnelle Stradaiole"
of Rome. These are present in large numbers on the walls or corners of historic
buildings. The idea consists in sending stimuli to users so as to guide them to
visit such shrines, customizing the path to their psychophysiological state. By
exploiting georeferencing, the ExPLoRAA system asks users to take pictures
of the shrines to be used, afterwards, to build games which, played together,
reduce social isolation and stimulate cognitive activity. The rst step for the
implementation of a scenario of this kind consists in collecting information about
the shrines like, for example, a brief history about each of them and their GPS
coordinates. Additionally, a customized questionnaire, administered to users, is
intended to extract an initial pro le to be used as a baseline. Starting by the
initial pro le, a path, compatible with the pro le, is selected and, step by step
and at proper time, suggested to the user (e.g., \go to pos1", \the shrine at
pos1 has been built in 1796", \take a picture at the shrine in pos1", \go to
pos4", etc.). By taking into account physiological data, the system can adapt
the route switching, for example, once the ExPLoRAA system realizes that the
user is not too tired, to a longer one, fostering physical activity and a prolonged
interaction with the other involved users. Finally, once back from the trip, the
ExPLoRAA system builds a \memory" game, challenging the participants to
discover, in the fewest possible steps, pairs of the taken pictures hidden under
the tiles, hence stimulating cognitive activity.</p>
      <p>Feedback gathering has taken place at the Televita facilities. Speci cally, a
focus group has been held in which volunteers of the association, as well as
representatives of other associations that deal with assistance to the elderly and/or
psychological distress present on the territory of the III Municipality of Rome,
have participated. Speci cally, 6 people dealing with Televita, 3 representatives
of \Societa San Vincenzo de Paoli", and 1 representative of the volunteering
organization \Oltre Le Barriere". The meeting (see Figure 5) has been structured
around the presentation of the developed prototype that proved to be functional
for eliciting comments and suggestions from the participants. We wanted to
address the discussion in the direction of feedback collection for what concerns the
improvement of the interface, the modalities of providing the service, the ways to
enhance the engagement, as well as the possibility for the participants to provide
suggestions and free comments.</p>
      <p>In general, the feedback obtained on the platform and its services was
decidedly positive and the participants found the play aspect of the project
particularly interesting. In fact, the game was read not only as a recreative tool, but
also as a learning and social cohesion one, a crucial aspect to promote well-being
in the elderly. Furthermore, the value of the possibility o ered to citizens who
can participate in the co-management of the public good through the municipal
volunteering has emerged and, thanks to ExPLoRAA, they have the
opportunity to take on some aspects in a territorial area thus favoring a certain sense of
belonging. This re ects the need to motivate older people to feel active, rather
than a burden for society or for the family. Participation in activities motivates
people and makes them feel alive. Determinant is also trying to cope with one
of the biggest problems of older people: the su ering of loneliness. It emerged,
indeed, that the proposed formula could represent an e ective tool, especially
considering the social character of the activities that are essentially based on the
aggregation and comparison between di erent people in a game context. The
possibility of personalizing the experience was judged to be very useful, both to
encourage the motivation and involvement of people during the activity as well
as to provide access to a wider range of users, taking into account possible
physical limitations. In this sense, the personalization of services is not de ned only
by psicological aspects, such as the level of engagement, attention, emotional
state, but also by more purely physical factors, such as fatigue. According to
the participants, these characteristics make the proposal even more e ective and
desirable. Finally, a very interesting aspect that emerged from the interaction
with the volunteers concerns the possibility of using the ExPLoRAA system
to favor inter-generational exchange. In fact, much emphasis has been given to
the possibility of exploiting the system to make elderly and young people
interact and to promote the comparison. In fact, a system focused on aspects such
as sharing and group activities favors the exchange, while taking into account
individual preferences and needs, thanks to the possibility of personalizing the
experience.
8</p>
    </sec>
    <sec id="sec-8">
      <title>Conclusions and Future Works</title>
      <p>By pursuing their didactic needs, teachers want exibility in adapting the
resulting network. Furthermore, teachers are human beings and, as such, might
change their idea. This paper introduces the ExPLoRAA system as an
AIbased learning environment specialized so as to support active aging. We have
introduced the general idea of supporting older people in maintaining themselves
mentally and physically active being helped by some intelligent technology both
during a class and during excursions. The ICT intelligent core makes use of a
speci c kind of arti cial intelligence technology called automated planning which
is responsible for representing the key ingredients of the ExPLoRAA system,
creating a baseline \lesson" and dynamically adapting it to actions and pro le
updates so as to integrate both personalized stimuli and requests to the users
over time. Additionally, the proposed system guarantees an e cient management
of the temporal constraints and, thanks to the introduction of the proposed
algorithm, the possibility for the teachers to e ciently change their minds regarding
decisions made on temporal aspects. Although the application is currently
under development, the constant contact with Televita's volunteers is allowing the
transition from a lab prototype to an incrementally more robust version of the
system to be tested in realistic scenarios.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Allen</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Maintaining Knowledge about Temporal Intervals</article-title>
          .
          <source>Commun. ACM</source>
          <volume>26</volume>
          (
          <issue>11</issue>
          ),
          <volume>832</volume>
          {
          <fpage>843</fpage>
          (
          <year>1983</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bacon</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cesta</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Coraci</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cortellessa</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De</surname>
            <given-names>Benedictis</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Grilli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Polutnik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Strickland</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          :
          <article-title>Training crisis managers with PANDORA</article-title>
          .
          <source>In: Proceedings of the 20th European Conference on Arti cial Intelligence</source>
          . pp.
          <volume>1001</volume>
          {
          <fpage>1002</fpage>
          . IOS Press (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Cesta</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cortellessa</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Benedictis</surname>
          </string-name>
          , R.D.:
          <article-title>Training for Crisis Decision Making - An Approach Based on Plan Adaptation</article-title>
          .
          <source>Knowledge-Based Systems 58</source>
          ,
          <fpage>98</fpage>
          {
          <fpage>112</fpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Cesta</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cortellessa</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Benedictis</surname>
          </string-name>
          , R.D.:
          <article-title>Using Training with Older People for Active Ageing in Time and Space</article-title>
          . In: AI*AAL@
          <article-title>AI*IA (</article-title>
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Cesta</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cortellessa</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De</surname>
            <given-names>Benedictis</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Fracasso</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>A tool for managing elderly volunteering activities in small organizations</article-title>
          . In: Esposito,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Basili</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Ferilli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Lisi</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.A</surname>
          </string-name>
          . (eds.)
          <source>AI*IA 2017: Advances in Arti cial Intelligence</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Cortellessa</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fracasso</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sorrentino</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Orlandini</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernardi</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Coraci</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De</surname>
            <given-names>Benedictis</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Cesta</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>ROBIN, a Telepresence Robot to Support Older Users Monitoring and Social Inclusion: Development and Evaluation</article-title>
          . Telemedicine and e-Health (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>De</surname>
            <given-names>Benedictis</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Cesta</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Integrating Logic and Constraint Reasoning in a Timeline-based Planner</article-title>
          .
          <source>In: AI*IA 2015 - XIVth International Conference of the Italian Association for Arti cial Intelligence</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>De</surname>
            <given-names>Benedictis</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Cesta</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>New Heuristics for Timeline-Based Planning</article-title>
          .
          <source>In: Proceedings of the 6th Italian Workshop on Planning and Scheduling A workshop of the XIV International Conference of the Italian Association for Arti cial Intelligence (AI*IA</source>
          <year>2015</year>
          ). pp.
          <volume>33</volume>
          {
          <issue>48</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Dechter</surname>
            ,
            <given-names>R.: Constraint</given-names>
          </string-name>
          <string-name>
            <surname>Processing</surname>
          </string-name>
          . Elsevier Morgan Kaufmann (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Dechter</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meiri</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pearl</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Temporal Constraint Networks</article-title>
          .
          <source>Arti cial Intelligence</source>
          <volume>49</volume>
          (
          <issue>1-3</issue>
          ),
          <volume>61</volume>
          {95 (May
          <year>1991</year>
          ), http://dx.doi.org/10.1016/
          <fpage>0004</fpage>
          -
          <lpage>3702</lpage>
          (
          <issue>91</issue>
          )
          <fpage>90006</fpage>
          -
          <lpage>6</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Ghallab</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nau</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Traverso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <source>Automated Planning: Theory and Practice</source>
          . Morgan Kaufmann Publishers Inc. (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Gronlund</surname>
            ,
            <given-names>N.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brookhart</surname>
            ,
            <given-names>S.M.:</given-names>
          </string-name>
          <article-title>Gronlund's Writing Instructional Objectives</article-title>
          . Pearson/Merrill Prentice Hall (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Lecoutre</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Constraint Networks: Techniques and Algorithms</article-title>
          . Wiley-IEEE Press (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Muscettola</surname>
          </string-name>
          , N.:
          <article-title>HSTS: Integrating Planning and Scheduling</article-title>
          . In: Zweben,
          <string-name>
            <given-names>M.</given-names>
            and
            <surname>Fox</surname>
          </string-name>
          , M.S. (ed.)
          <article-title>Intelligent Scheduling</article-title>
          . Morgan Kau mann (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Ohlsson</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>Some principles of intelligent tutoring</article-title>
          .
          <source>Instructional Science</source>
          <volume>14</volume>
          (
          <issue>3</issue>
          ),
          <volume>293</volume>
          {326 (May
          <year>1986</year>
          ), https://doi.org/10.1007/BF00051825
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Planken</surname>
            ,
            <given-names>L.R.</given-names>
          </string-name>
          , de Weerdt,
          <string-name>
            <given-names>M.M.</given-names>
            ,
            <surname>Yorke-Smith</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          :
          <article-title>Incrementally Solving STNs by Enforcing Partial Path Consistency</article-title>
          . In: Ho mann, J.,
          <string-name>
            <surname>Kautz</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brafman</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , Ge ner, H. (eds.)
          <source>Proceedings of the Twentieth International Conference on Automated Planning and Scheduling (ICAPS-10)</source>
          . pp.
          <volume>129</volume>
          {
          <fpage>136</fpage>
          . AAAI Press, Menlo Park, CA, USA (May
          <year>2010</year>
          ), http://repository.tudelft.nl/view/ir/uuid:3ca1a60e8de4-4207
          <string-name>
            <surname>-</surname>
          </string-name>
          93aa-27e1442ecc18/
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>VanLehn</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>The Relative E ectiveness of Human Tutoring</article-title>
          ,
          <source>Intelligent Tutoring Systems, and Other Tutoring Systems. Educational Psychologist</source>
          <volume>46</volume>
          (
          <issue>4</issue>
          ),
          <volume>197</volume>
          {
          <fpage>221</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Wenger</surname>
          </string-name>
          , E.:
          <article-title>Arti cial Intelligence and Tutoring Systems: Computational and Cognitive Approaches to the Communication of Knowledge</article-title>
          . Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (
          <year>1987</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>