<!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>Towards an ontological core for cognitively justified robots</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Stefano Borgo</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roberta Ferrario</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Claudio Masolo</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniele Porello</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Philosophy, University of Genova</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Laboratory for Applied Ontology, ISTC CNR</institution>
          ,
          <addr-line>Trento</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Robots built to interact with humans in everyday life need to organize, manage and elaborate information in ways that are not only reliable but also aligned with humans' understanding of the environment. The paper argues that cognitively motivated ontologies contribute to the development of techniques and to the organization of knowledge bases that take us closer to the construction of robot architectures suitable for smooth interactions with humans.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Ontology</kwd>
        <kwd>Cognitive robotics</kwd>
        <kwd>DOLCE</kwd>
        <kwd>Threshold operators</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. One, No One and One Hundred Thousand</title>
      <p>One of the central aims of robotics, especially when considered from the perspective of STS, is
to build an object that, when acting, is perceived by humans as a single agent (one), instead of
a combination of several interconnected devices and services (one hundred thousand), an
agent to interact with rather than something to use (no one). Being observationally coherent
and socially predictable is important for artificial embodied agents. A robot has usually a number
of components dedicated to collect data about the environment through a variety of sensors and
channels (cameras, audio systems, magnetic sensors, wireless communication . . . ), each with its
level of precision, capabilities and limitations (e.g. reflective or transparent objects may be a
challenge for optical technology) and possible interferences (from other devices and running
processes). Data, rough or pre-processed, coming from diferent sensors may not be easily
merged, e.g., due to diferences in tolerance, processing delays or contextual significance of some
features. Given that every sensor provides a reading of the environment or fragment of it, for the
agent to act coherently there must be a step in which data are reliably integrated and an overall
and coherent picture of the environment is generated. Methodologies for data integration,
especially when data themselves have to be read from diferent perspectives of the world (e.g.,
the physical and the social), are complex. On top of this, methodologies must be rational, robust
and produce results that are cognitively acceptable and justifiable. Otherwise the overall artificial
system will not be perceivable as a single agent, and what is built is a machine which falls
short of being a robot (no one). This means that the process of data integration should follow
principles inherited from cognitive sciences. Data integration is obviously not enough to reach
an interpretation of the available information enabling a meaningful interaction with humans.
In order to reach the latter, the robot’s knowledge should be enriched with input concerning
the socio-cultural environment in which it operates, including such diverse information as
attribution of roles, working practices, social rituals, taboos etc. Given the heterogeneity of
the information that robots should use when interacting with humans, a methodology for
organizing, deploying, and representing it is mandatory. In the next sections, we will propose a
cognitively motivated ontology as an appropriate means to tackle such complex issue.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Cognitive Ontology in the Agent’s Information Flow</title>
      <p>
        Techniques developed in applied ontology and KR are already exploited in robotics to some
extent [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. One of the purposes of applied ontology is the transparent and robust organization
and classification of data coherently with the conceptualization the observer has of reality [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
This efort led to develop several ontology-based methodologies which, paired with techniques
for decision making, can improve sensor data classification, data analysis and data integration.
      </p>
      <p>
        Generally speaking, a formal ontology is a general, reliable and well organized conceptual
system. This means that the ontology includes the most usable, domain-independent and widely
applicable concepts (generality), is expressed as a logical theory with Tarskian-style semantics,
has a rich axiomatization and carefully analyzed formal consequences (reliability); and is
constructed following explicitly motivated philosophical principles (justified organization).
Overall, an ontology relies on the symbolic representation of data, and its aim is to formalize
a view of the world, i.e., a way to coherently understand reality and what one expects to be
possible. The ontology DOLCE [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is an example of such systems. A knowledge-base built from
this ontology can model information from the agent’s perspective.
      </p>
      <p>
        As said, formal ontologies are written in logical languages such as first-order logic or, to
ensure the tractability of the reasoning services, in weaker fragments of first-order logic. A
fundamental family of languages for ontologies is that of Description Logics (DL). E.g., the Web
Ontology Language (OWL 2) [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ] corresponds essentially to the ℛℐ() DL [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>Logic-based ontologies are capable of specifying hard constraints on individuals, e.g. the
rigid distinction between an object and its qualities, or an object and its components. To cope
with concepts learnt from examples or data, one can introduce dedicated operators like the
Weighted Threshold Operators. Informally, these operators take a list of relevant concepts in the
ontology and treat them as features to define the newly learnt concept.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], we started studying weighted logics to provide cognitively meaningful representations
of concepts in ontologies, while in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], we studied threshold operators in the context of
DLs. In brief, if 1 . . .  are concept expressions, 1 . . .  ∈ R are weights, and  ∈ R is a
threshold, the new concept ∇∇(1 : 1, . . . ,  : ) (called a ‘Tooth expression’) classifies
the individuals  such that ∑︀{ :  applies to } ≥ . As a toy example, assume we wish
to capture a common-sense definition of mug. We list a number of relevant features with the
associated weights to indicate their relevance for an object to be classified as a mug. This is
expressed by the TBox axiom:
      </p>
      <p>Mug ≡ ∇∇
2(∃contains.Cofee</p>
      <p>⊔ Tea : 1,
∃hasBase.Circular : 1, ∃hasPart.Handle : 1, ∃isLargerThan.Cup : 1) (1)
That is, a mug is associated with features like: it contains cofee or tea, it has a circular base, it
has a handle, it is larger than some cups. The definition adds that, for being a mug, any two of
these four features sufice (here, 1 is the weight assigned to each feature, and 2 is the threshold).</p>
      <p>
        Threshold operators have been extensively studied in the context of circuit complexity theory
(e.g. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]), and they are also known in the neural network community by the name of perceptrons
(cf. e.g. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]). Extensions of DLs with threshold operators have been discussed also in [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ].
Classifications via the threshold concepts can be construed as knowledge-dependent, cf. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]: the
values depend on the knowledge base, so the classification depends on the knowledge available
to the agent. This aspect highlights the situated contextual nature of classification tasks.
      </p>
      <p>
        The benefits of Tooth expressions are briefly summarized as follows: ) they provide a
way to compactly define concepts that are human accessible: instead of writing a possibly
long disjunctive normal form (DNF) of concepts, we list the weighted relevant features and
a threshold; ) definitions provided in terms of Tooth can be grounded on cognitive theories
of concepts and categorization, like the theory of prototypes or the theory of exemplars, cf.
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]; ) adding Tooth expressions to rich DLs does not raise the computational complexity
of the reasoning services (cf. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]); ) the weights of the Tooth expressions can be learnt from
examples or past experience of an agent, so Tooth expressions can bridge symbolic knowledge
with experiential data. For details, we refer to [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Ontologizing the robot’s architecture</title>
      <p>
        Even if traditional problems in robotics (navigation, object detection, obstacle avoidance, object
grasping etc.) were completely solved, the types of information that a cobot should be able to
manage remain impressive [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Since our goal in this paper is to suggest an ontology-based
approach to information in robotics, and to exemplify it in the context of information integration,
we now show how this can be implemented in a generic robot architecture (Fig. 1) . It should
be clear from the earlier sections that our work is essentially about the meaning of information
(with impacts on its collection, organization and manipulation), which is typically a concern in
the robot’s modules controlled by knowledge representation techniques [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>KNOWLEDGE BASE</p>
      <p>Rules, expectations, beliefs
scenarios-behavior associations</p>
      <p>KB core module
(ontologically organized)
selected
scenarios
Interpretation
module</p>
      <p>parameters
Layout and situation
assessment module
(TOOTH operator)
symbolic
expressions
Data preprocessing</p>
      <p>layer
(e.g. via parametrized ML,DL)</p>
      <p>raw data
Sensorimotor layer
world model, beliefs,
behaviors,  rules
(selected info)
events, world model,
beliefs, rules,
monitoring
(selected info)
motion-related rules
(selected info)</p>
      <p>Task planning
module
selected
plans
Execution
module
motion
plans
Motion and
manipulation
plannning module
basic actions</p>
      <p>
        In Fig. 1 (bottom) data is collected by a sensorimotor module and then preprocessed by a
parametric module, typically relying on subsymbolic approaches. The information produced by
this latter module is available in logical format and is essentially about geometric information and
sensor-dependent features. This information is processed by the layout and situation assessment
module which identified objects and the overall layout of the (detectable) environment. The
Tooth expressions described in the previous sections are devised to integrate information at this
step. The layout and situation description is then passed to the interpretation module and to the
core of the knowledge base (which we do not discuss). The role of the interpretation module is
to elicit the interpretation of the situation, what we call a scenario. Briefly put, a situation is the
mere list of objects and their places in an environment (there are people forming a line), the
scenario is the social interpretation of what is going on (there is a queue), allowing to associate
to the actual state the relevant rules, behaviors and expectations as described in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. The rest
of the architecture, which we do not discuss here, describes the connections across the task and
geometric planners and the execution module.
      </p>
      <p>In this example, the discussion of section 3 refers to a module where both classical DL
expressions and Tooth expressions are used. While the DL expressions represent factual
knowledge (the ABox) or hard laws that regulate the universe of discourse, the Tooth expressions
define concepts under which entities can be classified on the basis of the data ( ABox statements)
returned by the data preprocessing layer.</p>
      <p>First note that, since Tooth expressions are legitimate logical concept constructors, they can
be exploited by, and can exploit, the reasoning capabilities of the main knowledge base module.
For instance, given the definition of Mug in equation (1), from the ontological knowledge
present in the KB core module one can infer that mugs are physical objects, that they are located
in space, that they have container functions, etc. Moreover, the ontological knowledge can
be used to deductively close the ABox returned by the preprocessing layer empowering the
classification mechanism. E.g., one can deploy known correlations among qualities to infer
objects’ features that the sensors were unable to directly observe.</p>
      <p>Second, Tooth definitions of concepts can be automatically built by running supervised
learning algorithms on the dataset of ABox statements provided by the preprocessing layer (at
a given time) with the major advantage of being in principle human readable and explainable.
Moreover, knowledge about planned actions and expectations can be used to modify or refine
these definitions (for example acting on the weights used by the Tooth expressions) on the
basis of the success of the actions undertaken by the robot. Finally, the Tooth definitions can
be used to guide the robot to focus on the acquisition of specific information with the goal
of disambiguating doubtful yet critical classifications. For instance, suppose that the robot is
unable to classify an object  because no threshold has been reached. Starting from the concepts
with the highest classification degree for  and possibly from knowledge of what is typically
present in a scenario, the robot can plan to make more observations and even run a check of its
sensors for possible malfunctioning.</p>
      <p>Third, even the robot architecture could be refined to match assumptions largely adopted by
cognitive theories of concepts and categorization. For instance, cognitive theories usually make
a distinction between concepts (e.g., dog, mug, tree), attributes (e.g., color, shape, texture), and
attribute-values (e.g., crimson, round, smooth). The classification of an object under a concept
is determined on the basis of its attribute-values and of the relevance and typicality of these
values. Attributes and attribute-values are strongly linked to the human perceptive system,
while concepts are cognitively more complex. This contrast can be simulated by assuming that
() by being closely linked to the available sensors, the preprocessing layer returns assertions
based on DL-concepts representing attribute-values, while () the complex concepts are defined
via Tooth-expressions involving only the DL-concepts corresponding to attribute-values with
weights representing the relevance and typicality for that concept.</p>
      <p>While the approach we have presented is cognitively interesting and adds the flexibility
of a parametrized classification, it also raises a series of problems. The elaboration of the
output of the sensors performed at the preprocessing layer could result in a set of assertions
that are inconsistent with the general knowledge in the KB core module or that generate
inconsistent classifications under Tooth-defined concepts. This happens, for instance, when
an individual satisfies enough features associated with concepts that are deemed disjoint by
an axiom in the KB core module. There can be several heterogeneous causes that lead to
this kind of conflict: the disjointness axiom might be wrong, the tagging of the data might
be mistaken, the Tooth definition of the concepts might be incomplete, the scenario might
have changed etc. There are approaches to overcome these conflicts, for instance by applying
judgment aggregation techniques in decision theory [17] that may use meta-information about
the sensors, for instance, their reliability in given contexts (see [18]).
247 (2017) 1 – 9.
[17] D. Porello, N. Troquard, R. Peñaloza, R. Confalonieri, P. Galliani, O. Kutz, Two approaches to
ontology aggregation based on axiom weakening, in: Proceedings of the Twenty-Seventh
International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018,
Stockholm, Sweden., 2018, pp. 1942–1948. URL: https://doi.org/10.24963/ijcai.2018/268.
doi:10.24963/ijcai.2018/268.
[18] C. Masolo, A. B. Benevides, D. Porello, The interplay between models and observations,
Applied Ontology 13 (2018) 41–71.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Olivares-Alarcos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Beßler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khamis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Goncalves</surname>
          </string-name>
          , et. al.,
          <article-title>A review and comparison of ontology-based approaches to robot autonomy</article-title>
          ,
          <source>Knowledge Engineering Review</source>
          <volume>34</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>N.</given-names>
            <surname>Guarino</surname>
          </string-name>
          ,
          <article-title>Formal ontology in information systems</article-title>
          , in: N.
          <string-name>
            <surname>Guarino</surname>
          </string-name>
          (Ed.),
          <source>Proceedings of the Second International Conference on Formal Ontology in Information Systems</source>
          , IOS Press,
          <year>1998</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Borgo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Masolo</surname>
          </string-name>
          , Foundational Choices in DOLCE, in: S. Staab, R. Studer (Eds.), Handbook on Ontologies, 2nd ed., Springer Verlag,
          <year>2009</year>
          , pp.
          <fpage>361</fpage>
          -
          <lpage>381</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>O. W.</given-names>
            <surname>Group</surname>
          </string-name>
          , et al.,
          <source>OWL 2 Web Ontology Language Document Overview: W3C Recommendation 27 October</source>
          <year>2009</year>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P.</given-names>
            <surname>Hitzler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krötzsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Parsia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. F.</given-names>
            <surname>Patel-Schneider</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>Rudolph, OWL 2 web ontology language primer</article-title>
          ,
          <source>W3C recommendation 27</source>
          (
          <year>2009</year>
          )
          <fpage>123</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>I.</given-names>
            <surname>Horrocks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. F.</given-names>
            <surname>Patel-Schneider</surname>
          </string-name>
          ,
          <article-title>Reducing OWL entailment to description logic satisfiability</article-title>
          , in: International semantic web conference, Springer,
          <year>2003</year>
          , pp.
          <fpage>17</fpage>
          -
          <lpage>29</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>C.</given-names>
            <surname>Masolo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Porello</surname>
          </string-name>
          ,
          <article-title>Representing concepts by weighted formulas</article-title>
          , in: S. Borgo,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hitzler</surname>
          </string-name>
          ,
          <string-name>
            <surname>O.</surname>
          </string-name>
          Kutz (Eds.),
          <source>Formal Ontology in Information Systems - Proceedings of the 10th International Conference, FOIS</source>
          <year>2018</year>
          ,
          <string-name>
            <surname>Cape</surname>
            <given-names>Town</given-names>
          </string-name>
          , South Africa,
          <fpage>19</fpage>
          -21
          <source>September</source>
          <year>2018</year>
          , volume
          <volume>306</volume>
          <source>of Frontiers in Artificial Intelligence and Applications</source>
          , IOS Press,
          <year>2018</year>
          , pp.
          <fpage>55</fpage>
          -
          <lpage>68</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.</given-names>
            <surname>Porello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kutz</surname>
          </string-name>
          , G. Righetti,
          <string-name>
            <given-names>N.</given-names>
            <surname>Troquard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Galliani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Masolo</surname>
          </string-name>
          ,
          <article-title>A toothful of concepts: Towards a theory of weighted concept combination</article-title>
          ,
          <source>in: Proceedings of the 32nd International Workshop on Description Logics</source>
          , volume
          <volume>2373</volume>
          ,
          <string-name>
            <surname>CEUR-WS</surname>
          </string-name>
          ,
          <year>2019</year>
          . URL: http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2373</volume>
          /paper-24.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Galliani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kutz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Porello</surname>
          </string-name>
          , G. Righetti,
          <string-name>
            <given-names>N.</given-names>
            <surname>Troquard</surname>
          </string-name>
          ,
          <article-title>On knowledge dependence in weighted description logic</article-title>
          ,
          <source>in: Proc. of the 5th Global Conference on Artificial Intelligence (GCAI</source>
          <year>2019</year>
          ),
          <year>2019</year>
          , pp.
          <fpage>17</fpage>
          -
          <lpage>19</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H.</given-names>
            <surname>Vollmer</surname>
          </string-name>
          ,
          <article-title>Introduction to circuit complexity: a uniform approach</article-title>
          , Springer Science &amp; Business
          <string-name>
            <surname>Media</surname>
          </string-name>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>C. M. Bishop</surname>
          </string-name>
          ,
          <source>Pattern recognition and machine learning</source>
          ,
          <source>Springer Science+ Business Media</source>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>F.</given-names>
            <surname>Baader</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Brewka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. F.</given-names>
            <surname>Gil</surname>
          </string-name>
          ,
          <article-title>Adding threshold concepts to the description logic ℰ ℒ</article-title>
          , in: C.
          <string-name>
            <surname>Lutz</surname>
          </string-name>
          , S. Ranise (Eds.),
          <source>Frontiers of Combining Systems</source>
          , Springer International Publishing, Cham,
          <year>2015</year>
          , pp.
          <fpage>33</fpage>
          -
          <lpage>48</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>F.</given-names>
            <surname>Baader</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ecke</surname>
          </string-name>
          ,
          <article-title>Reasoning with prototypes in the description logic ℒ using weighted tree automata</article-title>
          , in: A.
          <string-name>
            <surname>-H. Dediu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Janoušek</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Martín-Vide</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          Truthe (Eds.),
          <source>Language and Automata Theory and Applications</source>
          , Springer International Publishing, Cham,
          <year>2016</year>
          , pp.
          <fpage>63</fpage>
          -
          <lpage>75</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>G.</given-names>
            <surname>Righetti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Porello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kutz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Troquard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Masolo</surname>
          </string-name>
          ,
          <article-title>Pink panthers and toothless tigers: Three problems in classification</article-title>
          ,
          <source>in: Proc. of the 5th International Workshop on Artificial Intelligence and Cognition</source>
          , Manchester,
          <source>September 10-11</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Borgo</surname>
          </string-name>
          , E. Blanzieri,
          <article-title>Trait-based module for culturally-competent robots</article-title>
          ,
          <source>International Journal of Humanoid Robotics</source>
          <volume>16</volume>
          (
          <year>2019</year>
          )
          <fpage>1950028</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>K.</given-names>
            <surname>Rajan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Safiotti</surname>
          </string-name>
          ,
          <article-title>Towards a science of integrated ai and robotics</article-title>
          ,
          <source>Artificial Intelligence</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>