<!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>Arti cial intelligence agent for psycho-a ective accompaniment?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Gabriel Cervantes</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andres Mungu a</string-name>
          <email>andres.munguiabs@udlap.mx</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mauricio Osorio</string-name>
          <email>mauricioj.osorio@udlap.mx</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anah de los Santos Gomez</string-name>
          <email>anahi.delosantosg@udemex.edu.mx</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Grupo de Psiquiatr a y Psicolog a Infantil de Puebla</institution>
          ,
          <addr-line>Puebla</addr-line>
          ,
          <country country="MX">Mexico -</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>UDEMEX</institution>
          ,
          <addr-line>Toluca Mexico -</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Universidad de las Americas Puebla, Ex Hacienda Sta. Catarina Martir S/N. San Andres Cholula</institution>
          ,
          <addr-line>Puebla 72810, MX -</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>We propose a methodology based on an agent that, using arti cial intelligence, creates class notes for a speci c course, which are personalized and transformed, through the use of the phyton language, in conversations. Personalization is made based on a dynamic database that is built with the student. From this, the information obtained allows the elaboration of a pro le that includes: learning styles, motivations, interests and emotional situations that limit learning, among other information. In conversations cognitive elements are interpreted through logical formulas. For example, by detecting a user with a pro le prone to anxiety and a super cial learning approach, the DLV software traces routes to o er the user a variety of exercises based on mindfulness and other techniques that are related to their learning style, with the intention of helping the user to facilitate their state of receptivity and favor the learning process. The agent receives constant feedback to rede ne the characteristics and preferences of the user to be used in their next interaction.</p>
      </abstract>
      <kwd-group>
        <kwd>Intelligent Agents Sets Programming Mindfulness</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        We propose a methodology based on an agent that, using arti cial intelligence,
creates class notes for a speci c course, which are personalized and transformed,
through the use of the phyton language, in conversations. Our arti cial
intelligence approach is based on knowledge representation. "Knowledge
representation and reasoning is the foundation of arti cial intelligence, declarative
programming, and the design of knowledge-intensive software systems capable of
performing intelligent tasks" [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>Personalization is made based on a dynamic database that is built with the
student. From this, information is obtained that allows the elaboration of a
prole that includes: learning styles, motivations, interests and emotional situations
that might limit learning, among other information. On this regard, we de ned
a logical theory that de nes our knowledge about learning styles. We name VC
our methodology and we will refer to it in this way in the rest of our paper.
In sensing, a category well accepted in the context of learning styles we can nd
that: Sensors often like solving problems by well-established methods and dislike
complications and surprises.</p>
      <p>We claim that the given sentence has the suitable ingredients to be formalized
using answer set programming (ASP). It has already a standard structure of a
default logical rule. Note that modeling "oftenly" is considered as a major target
in ASP.</p>
      <p>In fact it is standard to rewrite the given sentence as: If given sensor S is not an
exeption then X like solving problems by well-established methods and dislike
complications and surprises.</p>
      <p>Its abstract logical form could be represented as: :ex(S) ! (X ^ Y ^ ^Z)
where</p>
      <p>X stand for: Sensors like solving problems by well-established methods.
Y stand for: Sensors dislike complications.</p>
      <p>Z stnd for: Sensors dislike surprises.</p>
      <p>
        Observe that :ex(S) ! (X ^ Y ^ ^Z) is strongly equivalent (see [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ]) to:
(:ex(S) ! X) ^ (:ex(S) ! Y ) ^ (:ex(S) ! Z).
      </p>
      <p>That we can split into 3 formulas:
:ex(S) ! X
:ex(S) ! Y
:ex(S) ! Z.</p>
      <p>Now, take for modeling purposes:</p>
      <p>:ex(S) ! Y namely, "Sensors often dislike complications".</p>
      <p>How do we interpret "complications"? In our case, it refers to "complicated
methods". So, we understand the above sentence as follows:
Oftenly, If S is a sensing learner, and X is a method, and X is complicated, then
it is not the case that S likes to learn X.</p>
      <p>Hence, the last sentence can be represented as:
- like_toK(S, X) :- sensing_learner(S),
complicated(X),
method(X),
not ex(S).</p>
      <p>In our context of ASP, " " is the strong negation operator, and "not" is the
default negation operator. Sometimes we also use : for "not".</p>
      <p>In conversations cognitive elements are re ected through logical formulas.
For example, by detecting a student with a pro le prone to anxiety and a
supercial learning approach, the DLV software traces routes to o er the student a
variety of exercises based on mindfulness and other techniques that are related
to their learning style, with the intention of helping the user to facilitate their
state of receptivity and favor the learning process. The student receives constant
feedback to rede ne their characteristics and preferences to be used in their next
interaction.</p>
      <p>The main contribution of our paper is the following: As far as the authors
know, this is the rst paper to explore the use of Answer Set Programming
(and in particular DLV) to de ne an intelligent agent (in collaboration with
Python) to generate automatic class notes considering the learning styles of
the students. Furthermore, unlike most herding literature, the paper employs
(enhances) dialogs to motivate the students.</p>
      <p>These enhanced dialogs include a versatile conversation (with emphasis in
the use of mindfulness).</p>
      <p>The paper is structured as follows: In the next section, we start by stating
the general background of the paper. Of particular interest we point out the use
of Answer Set Programming to model our logical agent. We provide in Section
3 an example of the kind of dialogs that our system could generate. In Section 4
we present the main contribution of our paper, namely the analysis, design and
implementation of our sysytem. We conclude the paper with a brief discussion
of related work and the achieved results.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Background</title>
      <p>In this section, we rst present the general background of Arti cial Intelligence
from this article.</p>
      <p>Then we continue to present the psychological/pedagogical background that
we consider relevant for the design of our system.
2.1</p>
      <sec id="sec-2-1">
        <title>Background</title>
        <p>Computer Science and Arti cial Intelligence have demonstrated and reached a
proper level of development in which it is possible to achieve our main objective.</p>
        <p>
          The scienti c goal of Arti cial Intelligence (AI) [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] is to comprehend
intelligence by building software that reveals intelligent comportment. AI deals with
the perceptions and approaches of gurative inference, or reasoning, by a
software sysytem, and how can the knowledge be used to create those inferences will
be embodied in the machine. The expression intelligence deals with many
cognitive skills such as understand natural languages, the ability to solve problems,
and learn.
        </p>
        <p>Recently, AI although is usually misunderstood by popularity as machine
learning using deep learning, AI is by far more than this. AI has growth in
several branches as science such as Knowledge Representation (KR), Expert
Systems (ES), Natural Language Processing (NLP), Logical Reasoning (LR), among
others.</p>
        <p>
          Around 1960, John McCarthy rst proposed the use of logical formulas as a
basis for a knowledge representation language of this type. However, it was
necessary to develop new semantics under logic programming languages to develop
Common Sense Reasoning such as Answer set Programming (ASP). Knowledge
representation (KR) is one of the most important subareas of arti cial
intelligence [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. If we want to design an entity (a machine or a program) capable of
behaving intelligently in some environment, then we need to supply this entity
with su cient knowledge about this environment. To do that, we need an
unambiguous language capable of expressing this knowledge, together with some
precise and well-understood way of manipulating sets of sentences of the
language which will allow us to draw inferences, answer queries, and to update
both the knowledge base and the desired program behavior.
        </p>
        <p>
          ASP [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] is a logic programming formalism for knowledge representation and
reasoning that posses the following suitable properties:
1. Based on di erent from classical logic, allows nonmonotonic reasoning: the
absence of beliefs can be used to make inferences, and the addition of beliefs
can prevent inferences. This allows the usage of ASP for de ning default
inferences that can be blocked once more information becomes available [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
2. It has three fundamental characteristics [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]: a modeling language based on
the syntax of logic programs, the use of the answer set semantics to interpret
programs in that language, and a problem-solving methodology in which a
program is written, so that its answer sets provide solutions.
3. It is a well known AI paradigm for decision-making and problem solving. It
has proven useful in a variety of application areas [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], such as Biology,
Psychology, Medicine and music composition. ASP is a declarative
programming language used to specify a problem in terms of general inference rules
and constraints, along with concrete information about the application
scenario.
4. It is a prominent knowledge representation and reasoning paradigm that
found both industrial and scienti c applications. The success of ASP is due to
the combination of two factors: a rich modeling language and the availability
of e cient ASP implementations [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
5. It is in close relationships to other formalisms such as Propositional
Satisability, Satis ability Modulo Theories, Quanti ed Boolean Formulas,
Constraint Programming, Planning, Scheduling and many others [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
        </p>
        <p>
          A robust and e ciency-oriented rst implementation of an ASP system called
DLV (Disjunctive Logic Programming) was made only available in 1997 after 15
years of theoretical research on ASP. The development of DLV was started in
1996 in a research project funded by the Austrian Science Fund. Currently DLV is
the subject of an international collaboration between the Vienna Technical
University and the University of Calabria [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. After its rst release, the DLV system
has been signi cantly improved over and over in the last years, and its language
has been enriched in several ways. Relevant optimization techniques have been
included in all DLV engine modules, containing database techniques for e cient
instantiation and novel techniques for response Set Veri cation, Heuristics and
Advanced Section Operators for the Model Generation. As a result, currently
DLV is generally accepted as the State of the Art. It is widely used by researchers
around the world and it is also competitive from the point of view of e ciency
with the most advanced systems in the eld of ASP[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
        </p>
        <p>
          In this paper we re-used and adapted a general architecture which is detailed
in [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] and [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. It is worth to mention that such architecture was
originally designed for the development of an intelligent chat-bot agent. But since
such architecture was aimed to chat with a student and since our textnotes are
presented as a hypothetical dialog between a student and a Teacher Assistant
(TA), we found feasible to re-use several ideas of such system (considering of
course some adjustements).
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Psychopedagogical Considerations</title>
        <p>
          The constructivist theory of education postulates that the subject builds his
knowledge based on contexts that are meaningful to him. In such a way that
the human being is conceived as an active agent of knowledge, making
interpretations of the world that surrounds him in order to adapt to social reality [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
Learning must include the exercise of what is learned, conceptual knowledge and
the learning context, which is inserted in the culture. From this perspective, the
subject is an active element, in charge of manufacturing and deciphering the
information it receives. [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. With each new interaction of the subject with his
environment, mental structures are developed that allow him to unite the past
knowledge with the new [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. In the construction and orientation of these
structures, the presence of a guide becomes essential, who can be the educator, virtual
or physical. This is in charge of planning the learning processes depending on
two levels of development [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]:
1) Real, that refers to what the subject is capable of doing without help.
2) Potential, that indicates what the person is capable of achieving with the help
of mediating elements.
        </p>
        <p>
          For the identi cation of these elements it is important that the educational
sta make use of tools that allow them to place the subject not only in the
levels of development, but also contribute so that the subject manages to
control the ways in which they learn. We have the classi cation of the learning
styles have been provided by Felder and Spurlin who describe each category in
one of the four dimensions: sensing/intuitive, visual/verbal, active/reactive and
sequential/global [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ].
        </p>
        <p>Although in some currents in psychology the scienti c evidence that learning
styles signi cantly improve learning itself is questioned (Tesia Marshik, to
mention one of these), this work assumes, without granting, that student emotional
situation in uences, directly or indirectly, in their learning.</p>
        <p>
          The well accepted constructivist theory aims to develop socialized learning
that allows the subject to be formed not only at the intellectual level but also
at the psycho-a ective level, using knowledge to build the reality in which it is
situated. The use of technological tools must be adapted to the student, making
modi cations to adapt to the user's needs. Baker mentions that in the speci c
case of the use of technological support systems in education, constant feedback
is required to allow the system to be constantly improved [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ].
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Motivation</title>
      <p>We present a short and incomplete example of notes generated for Laura, a
freshman college student whose major is literature. She is a student with a
considerable level of anxiety. Laura(of sensitive learning style) declares a lack of
understanding in her class. The name of the student character is also Laura, a
decision taken on purpose by the system. Before the interaction, each student
already provided personal and academic information, with the intention of o ering
a personalized intervention.</p>
      <p>Draco: Hi. Before starting, I would like to introduce myself. I am
something similar to a Teacher Assistant, you can call me Draco, my task will be
to accompany you in your learning processes, o ering you some techniques that
could help you a better understanding of some ideas of the course, and perhaps
increase your learning skills. But I will also be here to support you when you feel
tired, stressed, anxious, sad, or simply when you need a calmer state of mind. I
would like to ask you to be patient with me, since I am also learning and your
help will be very useful to me to improve. What is your name?</p>
      <p>Laura: My name is Laura</p>
      <p>Draco: Nice name Laura. Your name reminds me Laura Maria Caterina
Bassi. She was an Italian physicist and academic born in 1711. Recognised and
depicted as "Minerva" (goddess of wisdom), she was the second woman in the
world to earn the degree of Doctor of Philosophy (after the philosopher Elena
Cornaro Piscopia, who had received doctorate in 1678) and the rst woman
to have doctorate in science. You know what? she was also the rst salaried
woman teacher in a university. In fact, at one time she was the highest paid
employee. Even more, she eventually became the rst university professor in
the world. Imagine that she was also the rst woman member of any scienti c
establishment, when she was elected to the Academy of Sciences of the Institute
of Bologna in 1732. How great!</p>
      <p>Laura: How and where was Laura educated?</p>
      <p>Draco: Bassi had no formal education and was privately tutored from age
ve till she was twenty. By then she was well versed in all major disciplines
including sciences and mathematics. Noticing her ability, Prospero Lambertini,
the Archbishop of Bologna (later Pope Benedict XIV) became her patron. With
Lambertini's arrangement she publicly defended forty-nine theses before
professors of the University of Bologna on 17 April 1732, for which she was awarded a
doctoral degree on 12 May. A month later, she was appointed by the university
as its rst woman teacher, albeit with restriction to teach all-male classes.
Lambertini, by then the Pope, helped her to receive permission for private classes
and experiments, which were granted by the university in 1740. Bassi became
the most important populariser of Newtonian mechanics in Italy.</p>
      <p>Draco: I learn this information from Wikipedia. I love it!</p>
      <p>Draco: But tell me Laura, how do you feel today? Is there something you
would like to tell me?</p>
      <p>Laura: I do not feel well, I feel anxious and frustrated because I cannot
understand the class, I am very slow to learn and I despair.</p>
      <p>Draco: I understand, that must feel very overwhelming.</p>
      <p>We interrupt our example here.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Class Notes Intelligent Agent System Design</title>
      <p>The objective of the system is to generate logic text notes (in the form of a
dialogue) for the student. It is very important to bear in mind that the dialogue
constructed by the agent is staged by a hypothetical student that we hope re ects
the same real student.
4.1</p>
      <sec id="sec-4-1">
        <title>Brief Analysis</title>
        <p>
          AI approaches to problem-solving and decision-making are becoming more and
more complex, leading to a decrease in the understandability of solutions [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ].
The European General Data Protection Regulation (GDPR) have tried to tackle
this problem by stipulating a "right to explanation" for decisions made by AI
systems. It states that anyone has the right to reject a "decision based solely
on automated processing" that "signi cantly a ects" a person. This new
regulation may not come as a surprise since most Arti cial Intelligence methods are
"black-boxes", that is, they produce accurate decisions, but without the means
for humans to understand why a decision was computed [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]. This is specially
observed since the popularity of the use of machine learning as AI production
of software. Machine learning approaches uses neural networks (among others)
where the designed software are learning based on training examples but there is
no way to understand the knowledge learned in an explicit way. Since the neural
network is a mathematical structure framework based on probabilities, machine
learning works as learning of patterns by behaviorism to produce other patterns.
        </p>
        <p>
          However ASP as a Knowledge Representation/Reasoning programming
language has the advantage of expressing semantical expert knowledge in an explicit
way in such a way that it is possible to control the knowledge whenever an AI
agent expert system is being designed, as well as the inferences of this knowledge
and the knowledge that causes such inferences [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]. Here there is a wide spread
distance from machine learning for instance. A Machine Learning System (MLS)
could learn by training of examples the knowledge of expressions in a
community but a MLS is not able to control the type and semantics of the learned
knowledge. Cases have been reported where the Machine Learning Agents have
learned imprecise behaviors when they are trained with a broad amount of
examples, trying to model great amount of knowledge. On the other hand, ASP
allows structurally- to control the semantic aspects that signi cantly improves
the translation of problem stated in human terms, to o er AI solutions within a
context that may even contain ethical aspects within the model. These
considerations make the use of ASP plausible in the modelling of a family of problems,
including those discussed in this article. We highlight four predominant elements
1. An agent must have extensive knowledge of the domain in which it must
act, and on its own capacities and objectives. The domain is pedagogy and
psychology as well as the pro le of the student.
2. It should be able to frequently expand this knowledge by new information
coming from observations, communication with other agents, and awareness
of its own actions. Communication in our case is carried out with the student
periodically asking him to ll out surveys.
3. All this knowledge cannot be explicitly represented in the agent's memory.
        </p>
        <p>This implies that the agent should be able to reason, i.e. to extract knowledge
stored there implicitly.
4. Finally, the agent should be able to use its knowledge and its ability to reason
to rationally plan and execute its actions.</p>
        <p>
          Since the above observations assumes a solid theoretical foundations of agent
design, a robust proposal should be based on theories of knowledge
representation and reasoning. Two well known theories that we consider are: The theory of
logic programming and nonmonotonic reasoning [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ], [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ], and the theory
of actions and change [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ].
4.2
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Design</title>
        <p>
          The general design of our system is presented in this section. We follow a general
design of an intelligent agent as proposed in [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. Furthermore we consider in
addition the work presented in [11{13].
        </p>
        <p>Our agent follows the standard observe-think-act loop: It rst senses the
environment. In our case it asks the student to respond a survey. Then it loops
as follows:
1. An action selects a target, which is recorded in the agent's memory. Our
target is nothing more than the topic of a concrete enhanced lecture namely,
a lecture in the form of a dialogue between a TA and a student with a
psychological component. The agent uses a theory of intentions along with
background information in order to come up with a plan to achieve this
goal and form the intention to do it. The agent executes components of the
expected activity and keep the history of these executions along with the
observation what could have been done during this process.
2. It sense again the environment. In our case it asks again the student to
respond a new short survey.</p>
        <p>
          Student model The system assumes a student model that is almost empty at
the beginning but is updated thanks to the interaction between the student and
the system. This model is constructed based on the preferences and needs of the
student. Having a user model is fundamental in this kind of personalized systems
as we have learned and adjusted to our particular case from the presented in [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ].
A Master-Slave AI design We propose to follow a master-salve conceptual
design following a centralized approach as de ned in [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. Namely, we create
hundreds of slaves (at least one thousand) such that each of them can perform a
very concrete task. All the tasks correspond to interactions with our e-student.
An example could be as simple as ask the e-student the de nition of "an
interpretation", or just perhaps to congratulate the student for a particular reason.
A more complex task could be to progressively teach the student simple
mindfulness exercises or meditations exercises. Associated to each slave we have its
semantic knowledge. For instance, slave named E3 could correspond to an
exercise of sound-mindfulness, that belongs to the set of mindfulness exercises.
Further more, the system has an explicit logical rule saying that this type of
exercise normally helps to reduces anxiety, and so on. Note that these default
rules can naturally be expressed in ASP and are very useful in this context. All
the semantic knowledge of each slave plus a general theory of interaction among
them is written in DLV. The system can also be seen as an approach to automate
use of basic software component libraries. This reminds to the factory strategy
with the aim of making automated software composition [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ].
        </p>
        <p>The Intelligent Agent System At the beginning of the semester a student
is required to ll out a questionnaire. The student also provides feedback on
the clarity of the questionnaire. The survey consists of the predominant learning
style(s) of the student. In addition, it includes questions about the general pro le
of the student as well as other questions regarding the emotional status of the
student. The system is a Reasoning Planning System consists of a cycle of 4
sequential processes-modules described below.</p>
        <p>I. Abstract Script Dialogue Session (ASDS): The ASDS basically
consists of two modules of KB-reasoning represented and speci ed via ASP, the
lowest one consists of a logical theory (explained in further detail through the
next section) that generates a set of recommendations (resources/assets) that
would correspond to an abstract plan. The highest module consist of an ASP
program that proposes the ASDS plan solving an speci c problem based in its
logical theory of actions.</p>
        <p>The problem is to compose a dialogue session as a sequence of tasks such that
it tries to improve the knowledge of the e-student about the given subject. At
the same time, it is intended that the session o ers alternatives to the e-student
to relax the emotional state and help him to go through a series of exercises,
re ections and activities that o er added value to the session. Do not forget that
we refer here to the character of the class notes, not the real student. However,
we expect the student would become identi ed with his/her character.</p>
        <p>We wrote the formal de nition of a dialogue session using the standard
generate and test approach in ASP. Our de nition is the following:
asignFinal(I,Y) :- nOrden(I), rrr(Y),</p>
        <p>not thereIsAnotherOne(I,Y).
thereIsAnotherOne(I,Y) :- nOrden(I), rrr(Y), rrr(Y1), Y!=Y1,
asignFinal(I,Y1).
:- asignFinal(I,S), asignFinal(J,S), I != J.
where rrr is defined as:
rrr(R) :- resource(R), open(R), not yetUsed(R).</p>
        <p>The following is an just an example a logical rule in our theory of learning
styles .
%Sensor students often like solving problems by well-established methods
like_toK(S,s(X,M)) :- sensing_learner(S),
method(M),
type_of_method(M, well_est),
problem(X),
can_be_applied(M,X),
not ex(S).</p>
        <p>
          II Generating BSRL code: The idea behind the code that we call for
reference as BSRL code is to de ne a basic programming language such that
any program of our library is a highly malleable object where one could de ne
some operators (such as mutation, crossover composition, selection,
specialization, generalization). Two basic examples are the following Brie y speaking,
each instruction in the BSRL code is a triple &lt; l; o; a &gt; where l is a label, o
an operator and a is an argument. BSRL resembles a kind of machine assembly
language. Details can be obtained from [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
        </p>
        <p>III. Generation of the class notes (as a dialogue): The Dialogue
Module corresponds to the director of the orchestra that executes the composed
dialogue session as interactions of AI-Task with the e-student.</p>
        <p>IV. Feedback Extraction of Relevant Information and Knowledge
Module: We have two kinds of feedbacks: Real and Virtual
Real One: We apply a questionnaire, open and available to anyone who wants
to answer it, that provides feedback on the clarity of the class notes, as well as
eight other set of questions on his/her new mental state.</p>
        <p>Virtual One: This is the feedback that we are concern in our AI agent. This
module lters and updates the questions/answers of the dialogue between the
TA and the student characters. Recall that our system tries to simulate a possible
real conversation between the real student and the TA. For instance, if the survey
of the student shows interest in a given topic, the conversation address such topic
and the student character also shows interest in this topic. If necessary it might
uses random outcomes.
4.3</p>
      </sec>
      <sec id="sec-4-3">
        <title>Implementation (Pipeline)</title>
        <p>It is standard to write EDB to denote an extensional database, namely the facts
of a logic program. EDBi denotes the initial EDB. EDBx denotes the current
EDB. Let T be the theory (or logic program knowledge base) as described in
the previous subsection.</p>
        <p>A: The student is asked at the beginning of the course to ll out the initial
survey (that we call Si).</p>
        <p>B) We execute a basic python program that transforms Si into a le of DLV
facts, that we call EDBi. Let EDBx be EDBi.</p>
        <p>We loop steps (C, D, E) until the semester is over:</p>
        <p>C): We use EDBx as the input to execute our software to generate our notes
(for two weeks). So, given the theory T, we compute the answer sets of T union
EDBx.</p>
        <p>D): After the two weeks of classes we ask the student to ll out the follow-up
survey (that we call Sfu).</p>
        <p>E) A simple python program is executed to convert Sfu into a le of DLV
facts, that we call EDBu. Let EDBx be EDBx union EDBu.</p>
        <p>We respect to C) we use a unix shell le to execute DLV + Python to obtain
our intended class notes.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Results, conclusions and Future work</title>
      <p>Among the various applications of this work, we will mention that in addition
to the proposed application of creating notes that are appreciated by the reader
for adapting to their learning style, it can also serve as a "bridge" between the
styles that prevail within a radius of in uence of the reader. It is ambitious
to assume that each person can be characterized within a learning style. It is
reasonable to assume that each person is an amalgam of learning styles that
can even vary according to volatile moods. These personalized notes may o er a
range of possibilities, according to the knowledge bank and the interaction with
the reader.</p>
      <p>Some potential applications of the project we will mention the following:
-The use of the notes is not restricted to the use of the reader, also for the
academic faculty, not only for the teachers of the subject itself, but for subjects
in which the notes are interconnected: history, literature and philosophy, among
others. This has the advantage of presenting the knowledge and intellectual
development of humanity as a single entity connected in conducting threads
that are bidirectional. For teachers of a subject, it can help them to understand
the philosophy of their colleagues - after all, an instructor's marks largely re ect
their own teaching philosophy. It is possible to think from a pedagogical point
of view, that what is important about the notes is not in what they say, but
in what they stop saying. This is a key point in creating instructor notes, due
to obvious space limitations, the choice of perspective can be appreciated and
enriched by your academic peers.</p>
      <p>-Student knowledge is never overrated. This is possibly the reason for
evaluating them at regular intervals of time, by means of midterm exams, midterms, etc.
This in order to understand their learning process and make global adjustments
to the course for better understanding. However, global adjustments frequently
ignore the emotional state of the student as a critical element in their learning
process. The knowledge bases will allow to know more between the students and
the generations of students and their psycho-academic evolution.</p>
      <p>For future work we consider to explore the idea of representing Knowledge
using alternative non-monotonic paradigms (besides from ASP) such as those
found in [28{33].</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Gelfond</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kahl</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach</article-title>
          . Cambridge University Press (
          <year>2014</year>
          ),
          <source>ISBN 9781107782877</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Lifschitz</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pearce</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Valverde</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Strongly equivalent logic programs</article-title>
          .
          <source>ACM Trans. Comput. Log</source>
          .
          <volume>2</volume>
          (
          <issue>4</issue>
          ),
          <volume>526</volume>
          {
          <fpage>541</fpage>
          (
          <year>2001</year>
          ), https://doi.org/10.1145/383779.383783
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Osorio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perez</surname>
            ,
            <given-names>J. A. N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Arrazola</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Equivalence in Answer Set Programming</article-title>
          . In: A. Pettorossi, editor,
          <source>Logic Based Program Synthesis and Transformation</source>
          , 11th International Workshop, LOPSTR 2001, Paphos, Cyprus,
          <source>November 28-30</source>
          ,
          <year>2001</year>
          ,
          <string-name>
            <given-names>Selected</given-names>
            <surname>Papers</surname>
          </string-name>
          , vol.
          <volume>2372</volume>
          of Lecture Notes in Computer Science, pp.
          <volume>57</volume>
          {
          <issue>75</issue>
          ,
          <string-name>
            <surname>Springer</surname>
          </string-name>
          (
          <year>2001</year>
          ), https://doi.org/10.1007/3-540
          <source>-45607-4 4</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Abu-Nasser</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Medical expert systems survey</article-title>
          .
          <source>International Journal of Engineering and Information Systems (IJEAIS) 1</source>
          (
          <issue>7</issue>
          ),
          <volume>218</volume>
          {
          <fpage>224</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Baral</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gelfond</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Logic programming and knowledge representation</article-title>
          .
          <source>The Journal of Logic Programming</source>
          <volume>19</volume>
          ,
          <issue>73</issue>
          {
          <fpage>148</fpage>
          (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. Schuller, P.:
          <article-title>Answer Set Programming in Linguistics</article-title>
          .
          <source>KI-Kunstliche Intelligenz</source>
          <volume>32</volume>
          (
          <issue>2-3</issue>
          ),
          <volume>151</volume>
          {
          <fpage>155</fpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Denecker</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vennekens</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bond</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gebser</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Truszczynski</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The second answer set programming competition</article-title>
          .
          <source>In: International Conference on Logic Programming and Nonmonotonic Reasoning</source>
          , pp.
          <volume>637</volume>
          {
          <issue>654</issue>
          ,
          <string-name>
            <surname>Springer</surname>
          </string-name>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Lifschitz</surname>
          </string-name>
          , V.:
          <article-title>Answer set programming</article-title>
          . Springer International Publishing (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Gebser</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leone</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maratea</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perri</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ricca</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schaub</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Evaluation Techniques and Systems for Answer Set Programming: a Survey</article-title>
          .
          <source>In: IJCAI</source>
          , vol.
          <volume>18</volume>
          , pp.
          <volume>5450</volume>
          {
          <issue>5456</issue>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Leone</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pfeifer</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Faber</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eiter</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gottlob</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perri</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scarcello</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>The DLV System for Knowledge Representation and Reasoning</article-title>
          .
          <source>ACM Transactions on Computational Logic (TOCL) 7</source>
          ,
          <issue>499</issue>
          {
          <fpage>562</fpage>
          (
          <year>2002</year>
          ), https://doi.org/10.1145/1149114.1149117
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Osorio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zepeda</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Castillo</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cervantes</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carballido</surname>
            ,
            <given-names>J. L.</given-names>
          </string-name>
          : My University e-Partner. In: CONTIE, pp.
          <volume>150</volume>
          {
          <issue>1503</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Osorio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zepeda</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carballido</surname>
            ,
            <given-names>J. L.</given-names>
          </string-name>
          :
          <article-title>Towards a virtual companion system to give support during con nement</article-title>
          .
          <source>CONTIE</source>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Osorio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zepeda</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carballido</surname>
            ,
            <given-names>J. L.</given-names>
          </string-name>
          :
          <article-title>MyUBot: Towards an arti cial intelligence agent system chat-bot for well-being and mental health. Accepted in Arti - cial Intelligence for HEaLth, PersonaLized MedIcine</article-title>
          aNd WEllbeing Workshop at ECAI 2020.
          <article-title>(</article-title>
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Osorio</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Montiel</surname>
          </string-name>
          <string-name>
            <surname>M.</surname>
          </string-name>
          ,
          <string-name>
            <surname>L. A.</surname>
          </string-name>
          :
          <article-title>E-friend: A logical-based AI Agent System Chatbot for Emotional Well-being and Mental Health</article-title>
          .
          <source>Accepted in DeceptECAI 1st International Workshop on Deceptive AI at ECAI</source>
          <year>2020</year>
          .
          <article-title>(</article-title>
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>Guerra</given-names>
            <surname>Garcia</surname>
          </string-name>
          , J.:
          <article-title>El aporte de la teoria sociocultural de Vygotsky para comprender la construccion del conocimiento en el ser humano</article-title>
          .
          <source>Dilemas Contemporaneos: Educacion, Politica y Valores</source>
          <volume>7</volume>
          (
          <issue>2</issue>
          ) (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Martin</surname>
            ,
            <given-names>G. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martinez</surname>
            ,
            <given-names>R. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martin</surname>
            ,
            <given-names>M. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nieto</surname>
            ,
            <given-names>M. I. F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nunez</surname>
            ,
            <given-names>S. V. G.</given-names>
          </string-name>
          :
          <article-title>Acercamiento a las Teorias del Aprendizaje en la Educacion Superior</article-title>
          .
          <source>Revista UNIANDES Episteme</source>
          <volume>4</volume>
          (
          <issue>1</issue>
          ),
          <volume>48</volume>
          {
          <fpage>60</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Saez</surname>
            ,
            <given-names>M. R.</given-names>
          </string-name>
          :
          <article-title>La educacion constructivista en la era digital</article-title>
          .
          <source>Revista Tecnologia</source>
          , Ciencia y Educacion (
          <volume>12</volume>
          ) (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Cruz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lorenzo</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hernandez</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>La obra de Vygotsky como sustento teorico del proceso de formacion del profesional de la educacion primaria</article-title>
          .
          <source>Conrado</source>
          <volume>15</volume>
          ,
          <issue>600</issue>
          {
          <fpage>614</fpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Felder</surname>
            ,
            <given-names>R. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Spurlin</surname>
            ,
            <given-names>J. E.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Applications</surname>
          </string-name>
          , Reliability, and
          <article-title>Validity of the Index of Learning Styles</article-title>
          .
          <source>Intl. Journal of Engineering Education</source>
          <volume>21</volume>
          ,
          <issue>103112</issue>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Baker</surname>
          </string-name>
          , R.:
          <source>Stupid Tutoring Systems</source>
          , Intelligent Humans.
          <source>International Journal of Arti cial Intelligence in Education</source>
          <volume>26</volume>
          ,
          <issue>600</issue>
          {
          <fpage>614</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Fandinno</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schulz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Answering the why in answer set programming{A survey of explanation approaches</article-title>
          .
          <source>Theory and Practice of Logic Programming</source>
          <volume>19</volume>
          (
          <issue>2</issue>
          ),
          <volume>114</volume>
          {
          <fpage>203</fpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Baral</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gelfond</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Logic Programming</article-title>
          and
          <string-name>
            <given-names>Knowledge</given-names>
            <surname>Representation</surname>
          </string-name>
          .
          <source>J. Log. Program. 19/20</source>
          , 73{
          <fpage>148</fpage>
          (
          <year>1994</year>
          ), https://doi.org/10.1016/
          <fpage>0743</fpage>
          -
          <lpage>1066</lpage>
          (
          <issue>94</issue>
          )
          <fpage>90025</fpage>
          -
          <lpage>6</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Lifschitz</surname>
          </string-name>
          , V.:
          <article-title>Foundations of declarative logic programming</article-title>
          . In: G. Brewka, editor,
          <source>Principles of Knowledge Representation, CSLI Publications</source>
          (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Marek</surname>
            ,
            <given-names>V. W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Remmel</surname>
            ,
            <given-names>J. B.</given-names>
          </string-name>
          :
          <article-title>On the Foundations of Answer Set Programming</article-title>
          . In: A.
          <string-name>
            <surname>Provetti</surname>
          </string-name>
          , T. C. Son, editors,
          <source>Answer Set Programming</source>
          ,
          <article-title>Towards E cient and Scalable Knowledge Representation and Reasoning</article-title>
          ,
          <source>Proceedings of the 1st Intl. ASP'01 Workshop</source>
          , Stanford, CA, USA, March
          <volume>26</volume>
          -28,
          <year>2001</year>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Gelfond</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lifschitz</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <source>Action Languages. Electron. Trans. Artif. Intell</source>
          .
          <volume>2</volume>
          ,
          <issue>193</issue>
          {
          <fpage>210</fpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Baskar</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , et al.:
          <article-title>Cognitive architecture of an agent for human-agent dialogues</article-title>
          .
          <source>In: Practical Applications of Agents and Multi-Agent Systems</source>
          , pp.
          <volume>89</volume>
          {
          <issue>100</issue>
          ,
          <string-name>
            <surname>Springer</surname>
          </string-name>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Green</surname>
            <given-names>eld</given-names>
          </string-name>
          , J.,
          <string-name>
            <surname>Short</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Software factories: assembling applications with patterns, models, frameworks and tools</article-title>
          . In:
          <article-title>Companion of the 18th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications</article-title>
          , pp.
          <volume>16</volume>
          {
          <issue>27</issue>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Osorio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nieves</surname>
            ,
            <given-names>J. C.</given-names>
          </string-name>
          :
          <article-title>PStable Semantics for Possibilistic Logic Programs</article-title>
          . In:
          <string-name>
            <given-names>A. F.</given-names>
            <surname>Gelbukh</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. F. K</surname>
          </string-name>
          . Morales, editors,
          <source>MICAI 2007: Advances in Arti cial Intelligence, 6th Mexican International Conference on Arti cial Intelligence</source>
          , Aguascalientes, Mexico, November 4-
          <issue>10</issue>
          ,
          <year>2007</year>
          , Proceedings, vol.
          <volume>4827</volume>
          of Lecture Notes in Computer Science, pp.
          <volume>294</volume>
          {
          <issue>304</issue>
          ,
          <string-name>
            <surname>Springer</surname>
          </string-name>
          (
          <year>2007</year>
          ), https://doi.org/10.1007/978- 3-
          <fpage>540</fpage>
          -76631-5 28
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Osorio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jayaraman</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          : Aggregation and
          <string-name>
            <surname>Negation-As-Failure</surname>
          </string-name>
          .
          <source>New Gener. Comput</source>
          .
          <volume>17</volume>
          (
          <issue>3</issue>
          ),
          <volume>255</volume>
          {
          <fpage>284</fpage>
          (
          <year>1999</year>
          ), https://doi.org/10.1007/BF03037222
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Osorio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jayaraman</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plaisted</surname>
            ,
            <given-names>D. A.</given-names>
          </string-name>
          :
          <article-title>Theory of Partial-Order Programming</article-title>
          .
          <source>Science of Computer Programming</source>
          <volume>34</volume>
          (
          <issue>3</issue>
          ),
          <volume>207</volume>
          {
          <fpage>238</fpage>
          (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Nieves</surname>
            ,
            <given-names>J. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Osorio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zepeda</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory</article-title>
          .
          <source>Fundam. Informaticae</source>
          <volume>106</volume>
          (
          <issue>2-4</issue>
          ),
          <volume>295</volume>
          {
          <fpage>319</fpage>
          (
          <year>2011</year>
          ), https://doi.org/10.3233/FI-2011-388
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Nieves</surname>
            ,
            <given-names>J. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cortes</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Osorio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olmos</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gonzalez</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          :
          <article-title>De ning new argumentation-based semantics by minimal models</article-title>
          .
          <source>In: Seventh Mexican International Conference on Computer Science, ENC</source>
          <year>2006</year>
          ,
          <volume>18</volume>
          -22
          <source>September</source>
          <year>2006</year>
          , San Luis Potosi, Mexico, pp.
          <volume>210</volume>
          {
          <issue>220</issue>
          , IEEE Computer Society (
          <year>2006</year>
          ), https://doi.org/10.1109/ENC.
          <year>2006</year>
          .10
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Confalonieri</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nieves</surname>
            ,
            <given-names>J. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Osorio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vazquez-Salceda</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Possibilistic Semantics for Logic Programs with Ordered Disjunction</article-title>
          . In: S. Link, H. Prade, editors,
          <source>Foundations of Information and Knowledge Systems, 6th International Symposium, FoIKS</source>
          <year>2010</year>
          ,
          <article-title>So a</article-title>
          ,
          <source>Bulgaria, February 15-19</source>
          ,
          <year>2010</year>
          . Proceedings, vol.
          <volume>5956</volume>
          of Lecture Notes in Computer Science, pp.
          <volume>133</volume>
          {
          <issue>152</issue>
          ,
          <string-name>
            <surname>Springer</surname>
          </string-name>
          (
          <year>2010</year>
          ), https://doi.org/10.1007/978-3-
          <fpage>642</fpage>
          -11829-6 11
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>