<!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>COCOS: a typicality based COncept COmbination System</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Antonio Lieto</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gian Luca Pozzato</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alberto Valese</string-name>
          <email>alberto.valese@edug.unito.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dipartimento di Informatica, Universita` di Torino</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this short paper we describe COCOS, a tool we are currently developing in order to account for the phenomenon of combining prototypical concepts, an open problem in the fields of AI and cognitive modelling. COCOS is based on a probabilistic extension of the logic of typicality ALC + TR by inclusions p :: T(C) v D (“we have probability p that typical Cs are Ds”) and it embeds a set of cognitive heuristics for concept combination.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Inventing novel concepts by combining the typical knowledge of pre-existing ones is an
important human creative ability. Dealing with this problem requires, from an AI
perspective, the harmonization of two conflicting requirements that are hardly
accommodated in symbolic systems: the need of a syntactic compositionality (typical of logical
systems) and that one concerning the exhibition of typicality effects [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. According to
a well-known argument [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], in fact, prototypical concepts are not compositional. The
argument runs as follows: consider a concept like pet fish. It results from the
composition of the concept pet and of the concept fish. However, the prototype of pet fish cannot
result from the composition of the prototypes of a pet and a fish: e.g. a typical pet is
furry and warm, a typical fish is grayish, but a typical pet fish is neither furry and warm
nor grayish (typically, it is red).
      </p>
      <p>
        In this paper we describe our work in progress in this field of research. We describe
COCOS, a software system able to account for this type of human-like concept
combination. COCOS relies on a nonmonotonic Description Logic (DL) of typicality called
TCL (typical compositional logic) recently introduced in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. This logic, whose
complexity is ExpTime-complete as the underlying standard ALC, combines two main
ingredients. The first one relies on the DL of typicality ALC + TR introduced in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
In this logic, “typical” properties can be directly specified by means of a “typicality”
operator T enriching the underlying DL, and a TBox can contain inclusions of the
form T(C) v D to represent that “typical Cs are also Ds”. As a difference with
standard DLs, in the logic ALC + TR one can consistently express exceptions and
reason about defeasible inheritance as well. For instance, a knowledge base can
consistently express that “normally, athletes are in fit”, whereas “sumo wrestlers usually
are not in fit” by T(Athlete) v InFit and T(SumoWrestler ) v :InFit , given that
SumoWrestler v Athlete. The semantics of the T operator is characterized by the
properties of rational logic [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], recognized as the core properties of nonmonotonic
reasoning. ALC + TR is characterized by a minimal model semantics corresponding to an
extension to DLs of a notion of rational closure as defined in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] for propositional logic:
the idea is to adopt a preference relation among ALC + TR models, where intuitively
a model is preferred to another one if it contains less exceptional elements, as well as
a notion of minimal entailment restricted to models that are minimal with respect to
such preference relation. As a consequence, T inherits well-established properties like
specificity and irrelevance: in the example, the logic ALC + TR allows us to infer
T(Athlete u Bald ) v InFit (being bald is irrelevant with respect to being in fit) and,
if one knows that Hiroyuki is a typical sumo wrestler, to infer that he is not in fit, giving
preference to the most specific information.
      </p>
      <p>
        As a second ingredient, we consider a distributed semantics similar to the one of
probabilistic DLs known as DISPONTE [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], allowing one to label axioms with degrees
representing probabilities, but restricted to typicality inclusions. The basic idea is to
label inclusions T(C) v D with a real number between 0.5 and 1, representing its
probability, assuming that each axiom is independent from each others. The resulting
knowledge base defines a probability distribution over scenarios: roughly speaking, a
scenario is obtained by choosing, for each typicality inclusion, whether it is considered
as true or false. In a slight extension of the above example, we could have the need of
representing that both the typicality inclusions about athletes and sumo wrestlers have
a probability of 80%, whereas we also believe that athletes are usually young with a
higher probability of 95%, with the following KB: (1) SumoWrestler v Athlete; (2)
0:8 :: T(Athlete) v InFit ; (3) 0:8 :: T(SumoWrestler ) v :InFit ; (4) 0:95 ::
T(Athlete) v YoungPerson. We consider eight different scenarios, representing all
possible combinations of typicality inclusion: as an example, f((2); 1); ((3); 0); ((4); 1)g
represents the scenario in which (2) and (4) hold, whereas (3) does not. We equip each
scenario with a probability depending on those of the involved inclusions, then we
restrict reasoning to scenarios whose probabilities belong to a given and fixed range.
      </p>
      <p>
        The proposed system COCOS is able to tackle the problem of composing
prototypical concepts. As an additional element we employ a method inspired by cognitive
semantics [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] for the identification of a dominance effect between the concepts to be
combined: for every combination, we distinguish a HEAD, representing the stronger
element of the combination, and a MODIFIER. The basic idea is: given a KB and two
concepts CH (HEAD) and CM (MODIFIER) occurring in it, we consider only some
scenarios in order to define a revised knowledge base, enriched by typical properties
of the combined concept C v CH u CM . We use COCOS for the generation of novel
creative concepts, that could be useful in many applicative scenarios.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2 The COCOS system</title>
      <p>
        The current version of the system is implemented in Pyhton and exploits the translation
of an ALC + TR knowledge base into standard ALC introduced in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and adopted by
the system RAT-OWL [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. COCOS makes use of the library owlready2 1 that allows
one to rely on the services of efficient DL reasoners, e.g. the HermiT reasoner.
      </p>
      <p>Our system relies on the procedures developed for logic TCL. More in detail, we
consider a KB K = hR; T ; Ai where R is a finite set of rigid properties of the form
C v D, T is a finite set of typicality properties of the form</p>
      <p>p :: T(C) v D</p>
      <sec id="sec-2-1">
        <title>1 https://pythonhosted.org/Owlready2/</title>
        <p>where p 2 (0:5; 1) R is the probability of the typicality inclusion and A is the
ABox, i.e. a finite set of formulas of the form either C(a) or R(a; b), where a and b are
individual names, C is a concept and R is a role.</p>
        <p>Given two concepts CH and CM occurring in K, the logic TCL allows one to define
the compound concept C as the combination of the HEAD CH and the MODIFIER
CM , where C v CH u CM and the typical properties of the form T(C) v D to ascribe
to the concept C are obtained by selecting suitable scenarios. Intuitively, a scenario is
a knowledge base obtained by adding to all rigid properties in R and to all ABox facts
in A only some typicality properties coming from either the HEAD or the MODIFIER.
Each scenario is equipped by a probability defined as p1 : : : pi (1 q1) : : :
(1 qj ), where p1 :: T(E1) v F1; : : : ; pi :: T(Ei) v Fi are the typicalities included
in the scenario, whereas q1 :: T(G1) v H1; : : : ; qj :: T(Gj ) v Hj are those not
included in the scenario.</p>
        <p>Intuitively, the selected scenarios are those satisfying the following properties:
1. are consistent with respect to K;
2. are not trivial, in the sense that the scenarios considering all properties that can be
consistently ascribed to C are discarded;
3. are those giving preference to the typical properties of the HEAD CH (with respect
to those of the MODIFIER CM ). Notice that, in case of conflicting properties like D
and :D, given two scenarios w1 and w2 such that an inclusion p1 :: T(CH ) v D
belongs to w1 whereas p2 :: T(CM ) v :D belongs to w2, the scenario w2 is
discarded in favor of w1.</p>
        <p>In order to select the wanted scenarios, COCOS applies points 1, 2, and 3 above to
blocks of scenarios with the same probability, in decreasing order starting from the
highest one. More in detail, COCOS first discards all the inconsistent scenarios, then it
considers the remaining (consistent) ones in decreasing order by their probabilities. It
then considers the blocks of scenarios with the same probability as follows:
– it discards scenarios considered as trivial, consistently inheriting all (or most of)
the properties from the starting concepts to be combined;
– among the remaining ones, it discards those inheriting properties from the
MODIFIER in conflict with properties inherited from the HEAD in another scenario of
the same block (i.e., with the same probability);
– if the set of scenarios of the current block is empty, i.e. all the scenarios have been
discarded either because trivial or because preferring the MODIFIER, COCOS
repeats the procedure by considering the block of scenarios, all having the
immediately lower probability.</p>
      </sec>
      <sec id="sec-2-2">
        <title>The output of COCOS corresponds to the set of remaining scenarios.</title>
        <p>The knowledge base obtained as the result of combining concepts CH and CM into
the compound concept C is called C-revised knowledge base:</p>
        <p>KC = hR; T [ fp : T(C) v Dg; Ai;
for all D such that T(C) v D is entailed in all the scenarios selected by COCOS.
Notice that, since the C-revised knowledge base is still in the language of the TCL
logic, we can iteratively repeat the same procedure in order to combine not only atomic
concepts, but also compound concepts.</p>
        <p>Some pictures of COCOS are shown in Figure 2. An example of the application of
COCOS for the generation of a new concept is shown in the next concluding section.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>An Example of Application of COCOS</title>
      <p>We exploit the system COCOS as a creative support tool to generate a new type of
character in the field of computational creativity for a video game or a movie.</p>
      <p>Let us assume to generate a novel concept obtained as the combination of concepts
Villain (as HEAD) and Chair (as MODIFIER). Let K = hR; T ; ;i be as follows:</p>
      <sec id="sec-3-1">
        <title>R1 Villain v 9 ghtsFor :PersonalGoal</title>
      </sec>
      <sec id="sec-3-2">
        <title>R2 Villain v Animate</title>
      </sec>
      <sec id="sec-3-3">
        <title>R3 Villain v 9hasValues :NegativeMoralValues</title>
      </sec>
      <sec id="sec-3-4">
        <title>R4 Chair v hasComponent :SupportingSitComponent</title>
      </sec>
      <sec id="sec-3-5">
        <title>R5 Chair v hasComponent :Sit</title>
      </sec>
      <sec id="sec-3-6">
        <title>R6 CollectiveGoal u PersonalGoal v ?</title>
        <p>and T is as follows:</p>
      </sec>
      <sec id="sec-3-7">
        <title>T1 0:9 :: T(Villain) v 9hasIconicity :Demoniac</title>
      </sec>
      <sec id="sec-3-8">
        <title>T2 0:75 :: T(Villain) v 9hasOpponent :Hero</title>
      </sec>
      <sec id="sec-3-9">
        <title>T3 0:75 :: T(Villain) v Protagonist</title>
      </sec>
      <sec id="sec-3-10">
        <title>T4 0:8 :: T(Villain) v Impulsive</title>
        <p>T5 0:95 :: T(Chair ) v :Animate</p>
      </sec>
      <sec id="sec-3-11">
        <title>T6 0:95 :: T(Chair ) v hasComponent :Back</title>
      </sec>
      <sec id="sec-3-12">
        <title>T7 0:65 :: T(Chair ) v madeOf :Wood</title>
      </sec>
      <sec id="sec-3-13">
        <title>T8 0:8 :: T(Chair ) v Comfortable</title>
      </sec>
      <sec id="sec-3-14">
        <title>T9 0:7 :: T(Chair ) v In ammable</title>
        <p>We consider the 512 scenarios that can be generated from nine typicality inclusions T1–
T9, from which we discard the inconsistent ones, namely those including T5: indeed,
since R2 imposes that villains are animate, in the underlying ALC + TR we conclude
that Villain u Chair v Animate , therefore all scenarios including T5, imposing that
Villain u Chair v :Animate are inconsistent. We also discard the most obvious
scenario including all the typicality inclusions of T , having probability of 14%. Among the
remaining scenarios, the most probable contains all the inclusions related to the HEAD,
namely T1, T2, T3, and T4, whereas it contains T6, T8, and T9 concerning the
MODIFIER. This scenario is the preferred one from a cognitive point of view. However, in
this application setting, we could imagine to use our framework as a creativity support
tool and thus considering alternative - more surprising - scenarios by adding additional
constraints. For example, by imposing that the compound concept should inherit six
properties, we would get that the scenario having the highest probability (3:2%) is the
one including all the properties of the HEAD, namely T1, T2, T3 and T4, and two out
of four properties of the MODIFIER, namely T6 and T8, Similarly, we could decide to
prefer - still more surprising - scenarios, by selecting those with probability of 2:51%,
obtaining the following, plausible but not obvious, creative definitions of villain chair:</p>
      </sec>
      <sec id="sec-3-15">
        <title>T1 0:9 :: T(Villain u Chair ) v 9hasIconicity :Demoniac</title>
      </sec>
      <sec id="sec-3-16">
        <title>T2 0:75 :: T(Villain u Chair ) v 9hasOpponent :Hero</title>
      </sec>
      <sec id="sec-3-17">
        <title>T4 0:8 :: T(Villain u Chair ) v Impulsive</title>
      </sec>
      <sec id="sec-3-18">
        <title>T6 0:95 :: T(Villain u Chair ) v hasComponent :Back</title>
      </sec>
      <sec id="sec-3-19">
        <title>T8 0:8 :: T(Villain u Chair ) v Comfortable</title>
      </sec>
      <sec id="sec-3-20">
        <title>T9 0:7 :: T(Villain u Chair ) v In ammable</title>
      </sec>
      <sec id="sec-3-21">
        <title>T1 0:9 :: T(Villain u Chair ) v 9hasIconicity :Demoniac</title>
      </sec>
      <sec id="sec-3-22">
        <title>T3 0:75 :: T(Villain u Chair ) v Protagonist</title>
      </sec>
      <sec id="sec-3-23">
        <title>T4 0:8 :: T(Villain u Chair ) v Impulsive</title>
      </sec>
      <sec id="sec-3-24">
        <title>T6 0:95 :: T(Villain u Chair ) v hasComponent :Back</title>
      </sec>
      <sec id="sec-3-25">
        <title>T8 0:8 :: T(Villain u Chair ) v Comfortable</title>
      </sec>
      <sec id="sec-3-26">
        <title>T9 0:7 :: T(Villain u Chair ) v In ammable</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Frixione</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lieto</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Representing concepts in formal ontologies: Compositionality vs</article-title>
          .
          <source>typicality effects. Logic and Logical Philosophy</source>
          <volume>21</volume>
          (
          <issue>4</issue>
          ) (
          <year>2012</year>
          )
          <fpage>391</fpage>
          -
          <lpage>414</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Osherson</surname>
            ,
            <given-names>D.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>E.E.</given-names>
          </string-name>
          :
          <article-title>On the adequacy of prototype theory as a theory of concepts</article-title>
          .
          <source>Cognition</source>
          <volume>9</volume>
          (
          <issue>1</issue>
          ) (
          <year>1981</year>
          )
          <fpage>35</fpage>
          -
          <lpage>58</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Lieto</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pozzato</surname>
            ,
            <given-names>G.L.:</given-names>
          </string-name>
          <article-title>A description logic of typicality for conceptual combination</article-title>
          .
          <source>In: Proceedings of the 24th International Symposium on Methodologies for Intelligent Systems ISMIS2018</source>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Giordano</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gliozzi</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olivetti</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pozzato</surname>
            ,
            <given-names>G.L.</given-names>
          </string-name>
          :
          <article-title>Semantic characterization of Rational Closure: from Propositional Logic to Description Logics</article-title>
          .
          <source>Artif. Intelligence</source>
          <volume>226</volume>
          (
          <year>2015</year>
          )
          <fpage>1</fpage>
          -
          <lpage>33</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Magidor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>What does a conditional knowledge base entail?</article-title>
          <source>Artificial Intelligence</source>
          <volume>55</volume>
          (
          <issue>1</issue>
          ) (
          <year>1992</year>
          )
          <fpage>1</fpage>
          -
          <lpage>60</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Riguzzi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bellodi</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lamma</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zese</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Reasoning with probabilistic ontologies</article-title>
          . In
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wooldridge</surname>
          </string-name>
          , M., eds.
          <source>: Proceedings of IJCAI</source>
          <year>2015</year>
          .
          <volume>4310</volume>
          -
          <fpage>4316</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hampton</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          :
          <article-title>Inheritance of attributes in natural concept conjunctions</article-title>
          .
          <source>Memory &amp; Cognition</source>
          <volume>15</volume>
          (
          <issue>1</issue>
          ) (
          <year>1987</year>
          )
          <fpage>55</fpage>
          -
          <lpage>71</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Giordano</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gliozzi</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pozzato</surname>
            ,
            <given-names>G.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Renzulli</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>An efficient reasoner for description logics of typicality and rational closure</article-title>
          .
          <source>In: Proc. of DL 2017</source>
          .
          <article-title>Volume 1879 of CEUR</article-title>
          . (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>