<!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>
      <journal-title-group>
        <journal-title>M. Luck);</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Subsymbolic to Symbolic: A Blueprint for Investigation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Joseph Pober</string-name>
          <email>joseph.pober@kcl.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michael Luck</string-name>
          <email>michael.luck@kcl.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Odinaldo Rodrigues</string-name>
          <email>odinaldo.rodrigues@kcl.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Workshop Proceedings</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Informatics, Bush House, King's College London</institution>
          ,
          <addr-line>London WC2B 4BG</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>NESY 2022: 16th International Workshop on Neural-Symbolic Learning and Reasoning</institution>
          ,
          <addr-line>Cumberland Lodge, Windsor</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2061</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0001</lpage>
      <abstract>
        <p>ion about phenomena in the environment being observed in the layers below. Through an iterative process, the diferences between the elements in successive iterations within a given layer are captured as transformations between the elements and used for identification and recognition of objects as well as prediction and verification of the environment in future iterations. A bridge between the subsymbolic and symbolic levels can be built by successively adding layers at ever more sophisticated levels of abstraction. This approach aims to benefit from subsymbolic learning, while harnessing the abstraction and reasoning powers of classical symbolic AI techniques.</p>
      </abstract>
      <kwd-group>
        <kwd>neuro-symbolic integration</kwd>
        <kwd>predicate learning</kwd>
        <kwd>learning structured representations</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>stage  :
stage  +  :</p>
      <p>attention
−−−−−−−−−−−→</p>
      <p>attention
−−−−−−−−−−−→
identification
−−−−−−−−−−−→
recognition
−−−−−−−−−−−→
 1  1
Figure 1: Initial image at subsymbolic level showing the identification of areas of interest in one stage, and the
subsequent recognition of objects at a later stage.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Learning about Objects</title>
      <p>Suppose we want to describe in a symbolic way a scene perceived as a sequence  of still images, each
represented as a binary matrix   of  ×  picture elements (pixels)  =  0,  1,  2, …. For simplicity, let us
assume that these elements are binary, i.e., 0 or 1 (resp., ‘white’ – background, and ‘black’ – foreground).
We can interpret each matrix as a snapshot of the world at a particular point in time and the sequence of
matrices as the world’s evolution over time. This paper describes what is involved, aiming to provide a
blueprint for investigation.</p>
      <p>
        In the first stage, we distinguish objects in the scene and associate symbols to them (an ongoing problem
both in philosophy [
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6">3, 4, 5, 6</xref>
        ] and computer science [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ]). While there have been prior formalisations of
this problem [
        <xref ref-type="bibr" rid="ref10 ref11 ref9">9, 10, 11</xref>
        ], the notion of ‘object’ in our approach is central. Here we need to make suitable
assumptions about what is of interest (to an agent) in the image and, for simplicity, assume that the black
pixels are associated with objects of interest in the real world.
      </p>
      <p>
        Consider the matrices in Figure 1. It is not dificult to identify at the subsymbolic (pixel) level the areas in
red representing structured elements (or patterns), which we refer to as objects, within our unstructured
input space. Let us assume that this can be done in an unsupervised manner using, e.g., an attention
function [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ], defining areas of interest (AoIs)  1,  2,  3, … . This process should allow not only the
creation of tracking mechanisms for the areas of interest in the images, but also the creation of new symbols
for real-world objects and hence the establishment of an association between the real-world object, its
perception and identification/recognition by the system (through some appropriate mechanism), and a
symbolic representation. We aim to develop a framework in which objects, their properties, and the way in
which they change can all be expressed and linked to these symbolic representations.
      </p>
      <p>
        Our first objective is therefore to create a set of symbols and link these with a subsymbolic representation.
To this end, the representation of an object, which we call a signature, exists in a more abstract space [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]
than the direct visual representation of an AoI. The process of creating new symbols, e.g.  1,  2,  3, and
linking them to an abstract representation (see Figure 1, top), which we call identification , aims in part to
allow these objects to be recognised in subsequent images. This is not trivial as diferences in AoIs arise
due to movement, inaccurate sensor information, etc., so there must be suficient information to allow the
association of the signature of an object in a new image with those from old images and the consequent
retrieval of the previously associated symbols — we call this process recognition (see Figure 1, bottom).
      </p>
      <p>
        By comparing distinct objects (in the same image) we can learn about similarities and diferences [
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ],
generating a set of subsymbolic abstract properties  1,  2, …, each assigned its own symbol,  1,  2, …,
thus linking the property’s symbol to its subsymbolic representation in a process analogous to that of
object-symbol creation. Initially, these properties are broad, yet object-specific — they are learnt from
only one object. Once multiple objects have been identified with primitive properties created, these can be
compared, finding similarities and distinctions that can be expressed as new properties themselves.
 0
      </p>
      <p>1
 0
−−−−−−−−→
 0</p>
    </sec>
    <sec id="sec-3">
      <title>3. Reasoning About Transformations</title>
      <p>Assuming we have mechanisms for uniquely identifying and recognising objects, we want to represent
how objects change over time, aiming to express temporal transformations symbolically, retaining the
association between the transformation and the representation. To be clear, if we perceive a change in the
AoIs associated with a recognised object in successive images, we also want to associate a symbol with this
change, allowing future reasoning about the transformation’s ‘meaning’.</p>
      <p>Consider the transformation  0 of matrix  0 into  1 on the left of Figure 2. At the subsymbolic level,
we can consider the transformation applied to  0 as a whole, but to reason about the objects in the image,
we are more interested in the transformations applied to the AoIs  1,  2 and  3, denoted by  01,  02, and  03,
respectively (see right hand side of Figure 2). Assume that the area   is associated with object   in matrix
  . For example,  01 is associated with object  1 in  0 and  11 with object  1 in  1, etc. Our task is to define
the commutative diagram in Figure 3, so that  (
 ) is indeed a faithful representation of object   in   .</p>
      <p />
      <p>The ∗ in the commutative diagram of Figure 3, which shows the relationship between subsymbolic and
symbolic levels, is intentional because in general multiple translations may be necessary to achieve the right
level of abstraction at the symbolic level. In addition, the dotted lines indicate that the transformations
may not necessarily be precise (see Section 4). This potential need for multiple translations is especially
important in the generalisation of transformations involving the same object through a sequence of matrices.
atomic symbol  (</p>
      <p>Consider the problem of defining the concept of moving an object ‘up’ in a matrix and then generalising
this notion to other objects. At the subsymbolic level, this operation transforms the region  01 (of  0) into  11
(of  1). We could give this transformation a symbol so that, e.g., the transformation  01 is represented by the
01), but we would not be able to describe (in symbolic terms) what this transformation
entails, hence it will be impossible to generalise it or to reason about it in more abstract terms. This means
that in general we want  ( 01) not to be atomic in our symbolic language and, consequently,  ( 01) should be
expressed in terms of how it afects some specific properties of objects (in this case  1’s ‘location’).  ( 01)
must provide a faithful representation of  01, meaning that the transformation from  ( 01) into  ( 11) must be
such that  ( 11) indeed represents  11, i.e., efectively how  1 would be identified/recognised in  1 (hence
commuting the diagram of Figure 3). Because of the complexity of the operations involved, it may be
suficient for this process to simply be a “good enough” approximation.</p>
      <p>The next question is then what should the appropriate level of granularity of these representations be for
our exercise? The answer to this question is not simple, but in principle, we want the granularity to reflect
the level of reasoning we hope to be able to capture. As an example, suppose that we need the relative
positioning of the “boundaries” of  1 within  0 and  1 (a reasonable assumption if we need to express the
“movement” of objects). This means that we need to assume some coordinate/geometrical primitives which
are available to us at the subsymbolic level, so that we can understand how to represent them symbolically.
Thus, the identification process of  1 must include these elements yielding a signature for  1 that is not
only suficient for the recognition of  1 in diferent matrices, but that also contains the basic ingredients
for the description of the properties of  1 that we need at the symbolic level. One such property could be,
for example,  1’s relative position with respect to a common coordinate or to another area of interest (e.g.,
another object). Once we are happy with the basic components of  1’s signature we can associate it with
 01 and our job will be complete if  ( 01) is capable of producing a faithful symbolic representation of the
signature  11 in the form of  ( 11).</p>
      <p>We gloss over a number of complications for now, but it should be easy to understand that we can only
describe concepts at the symbolic level that we can somehow capture at the subsymbolic one. In practice,
this means that what we associate with  1 in Figure 1 at the subsymbolic level needs to capture enough of
the relationship of  1 with the rest of   so that we can describe it at the symbolic level in suficient detail
for the application in mind.</p>
    </sec>
    <sec id="sec-4">
      <title>4. General Knowledge, Verification, Predictions and Revisions</title>
      <p>Consider the game of Pong mentioned in Section 1, which is represented as a sequence of matrices  =
 0,  1, … at the subsymbolic level. Some areas in the matrices are associated with objects, i.e., the ball and
paddles. The objects may change in the sequence, e.g., by appearing in diferent locations in the matrices.
These changes represent the notion of movement of the objects and can be used to describe how the scene
evolves through time. We can perceive the changes between the matrices as transformations  0,  1, etc
(see Figure 4). The challenge is to find a mechanism that describes the transformations in a way that is
adequate for the application at hand. For example, we would like to describe  0 as a change in the relative
 -coordinate of the left paddle and of the  -coordinate of the ball in  1 with respect to their values in  0
while still being able to associate the corresponding AoIs in  1 with the ‘same’ objects identified in  0.
Eventually, we want to produce a sequence of representations  ( 0),  ( 1), etc, that describe the objects in a
symbolic language, leading to symbolic representations  ( 0),  ( 1), …, etc, of the matrices themselves.
 0
 1
 2
 3
 4
 0 −−→0  1 −−→1  2
Figure 4: Transformations across a sequence of images.
 2
−−→
 3
 3
−−→
 4</p>
      <p>To a large extent, we have only considered objects in isolation, but in general the subsymbolic
representation may encode domain information about the objects’ relationships that is valuable for symbolic
reasoning. In our example, information embedded in the matrices   , such as the total number of objects, or
their direction of travel with respect to each other, will not generally be captured by individual signatures of
objects identified. An important consideration is therefore how to incorporate general knowledge Γ that we
need to add to  (
 ) s.t. Γ ∪  (</p>
      <p>
        ) is also faithful with respect to   for the particular application. Note that
this notion of general knowledge is related (but distinct) to that of common sense priors mentioned in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
      </p>
      <p>The transformations   should eventually allow us to perform basic predictions about what future matrices
should look like, e.g., through simulating the application of transformations to generate the next state.
Verification of the predictions against actual inputs should provide opportunities for revision that generate
more accurate translations with time. This results in a temporal aspect of the whole process as well. This
dimension is depicted along the horizontal axis of the diagram of Figure 5.
 0</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>In this paper, we proposed the conceptualisation of a multi-layered framework for neuro-symbolic integration
with learning. Although we have not provided a concrete instantiation, this level of separation between
symbolic and sub-symbolic reasoning, and the proposed mode of integration, is novel and generalises other
approaches by providing an initial scafold upon which to employ specific techniques.</p>
      <p>The initial focus is on how to define the basic ingredients with which a generic neuro-symbolic process
can be devised that allows the association of subsymbolic components to symbolic counterparts, in a way
that avoids hand-crafted symbols. We envisage the definition of object ‘signatures’ associating areas of
interest in an image, the process that recognises them, and other components derived over time, and we
postulate that comparisons between signatures can allow for the definition of some primitive concepts,
such as properties, transformations, etc. More complex concepts can then be built from these in layers at
increasing levels of abstraction, eventually leading to the development of a symbolic language over time
arising from completely subsymbolic inputs.</p>
      <p>Finally, we see revisions of the model arising through comparisons of predictions of future states with
actual inputs. In future work, we will investigate how interactions and relationships between objects can be
captured symbolically using these ideas.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work was supported by UK Research and Innovation grant number EP/S023356/1, in the UKRI Centre
for Doctoral Training in Safe and Trusted Artificial Intelligence ( https://www.safeandtrustedai.org).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>B. M.</given-names>
            <surname>Lake</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. D.</given-names>
            <surname>Ullman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. B.</given-names>
            <surname>Tenenbaum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. J.</given-names>
            <surname>Gershman</surname>
          </string-name>
          ,
          <article-title>Building machines that learn and think like people</article-title>
          ,
          <source>Behavioral and Brain Sciences</source>
          <volume>40</volume>
          (
          <year>2017</year>
          )
          <article-title>e253</article-title>
          . doi:
          <volume>10</volume>
          .1017/S0140525X16001837.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B.</given-names>
            <surname>Goertzel</surname>
          </string-name>
          ,
          <article-title>Perception processing for general intelligence: Bridging the Symbolic/Subsymbolic gap</article-title>
          , in: J.
          <string-name>
            <surname>Bach</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Goertzel</surname>
          </string-name>
          , M. Iklé (Eds.),
          <source>Artificial general intelligence</source>
          , volume
          <volume>7716</volume>
          of Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg,
          <year>2012</year>
          , pp.
          <fpage>79</fpage>
          -
          <lpage>88</lpage>
          . doi:
          <volume>10</volume>
          .1007/ 978- 3-
          <fpage>642</fpage>
          - 35506-
          <issue>6</issue>
          _
          <fpage>9</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Taddeo</surname>
          </string-name>
          , L. Floridi,
          <article-title>Solving the Symbol Grounding Problem: A Critical Review of Fifteen Years of Research</article-title>
          ,
          <source>Journal of Experimental &amp; Theoretical Artificial Intelligence</source>
          <volume>17</volume>
          (
          <year>2005</year>
          )
          <fpage>419</fpage>
          -
          <lpage>445</lpage>
          . doi:
          <volume>10</volume>
          . 1080/09528130500284053.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Cangelosi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Greco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Harnad</surname>
          </string-name>
          ,
          <article-title>Symbol Grounding and the Symbolic Theft Hypothesis</article-title>
          , in: A.
          <string-name>
            <surname>Cangelosi</surname>
          </string-name>
          , D. Parisi (Eds.),
          <source>Simulating the Evolution of Language</source>
          , Springer, London,
          <year>2002</year>
          , pp.
          <fpage>191</fpage>
          -
          <lpage>210</lpage>
          . URL: https://doi.org/10.1007/978-1-
          <fpage>4471</fpage>
          -0663-
          <issue>0</issue>
          _9. doi:
          <volume>10</volume>
          .1007/978- 1-
          <fpage>4471</fpage>
          - 0663-
          <issue>0</issue>
          _
          <fpage>9</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>L.</given-names>
            <surname>Steels</surname>
          </string-name>
          ,
          <article-title>The symbol grounding problem has been solved. So what's next?</article-title>
          , in: M. de Vega (Ed.),
          <source>Symbols and embodiment: Debates on meaning and cognition</source>
          , Oxford University Press, Oxford,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bringsjord</surname>
          </string-name>
          ,
          <article-title>The symbol grounding problem … remains unsolved</article-title>
          ,
          <source>Journal of Experimental &amp; Theoretical Artificial Intelligence</source>
          <volume>27</volume>
          (
          <year>2015</year>
          )
          <fpage>63</fpage>
          -
          <lpage>72</lpage>
          . doi:
          <volume>10</volume>
          .1080/0952813X.
          <year>2014</year>
          .
          <volume>940139</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Cubek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ertel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Palm</surname>
          </string-name>
          ,
          <string-name>
            <surname>A Critical</surname>
          </string-name>
          <article-title>Review on the Symbol Grounding Problem as an Issue of Autonomous Agents</article-title>
          , in: S. Hölldobler,
          <string-name>
            <given-names>R.</given-names>
            <surname>Peñaloza</surname>
          </string-name>
          , S. Rudolph (Eds.),
          <source>KI 2015: Advances in Artificial Intelligence</source>
          , volume
          <volume>9324</volume>
          of Lecture Notes in Computer Science, Springer International Publishing, Cham,
          <year>2015</year>
          , pp.
          <fpage>256</fpage>
          -
          <lpage>263</lpage>
          . doi:
          <volume>10</volume>
          .1007/978- 3-
          <fpage>319</fpage>
          - 24489- 1_
          <fpage>21</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Coradeschi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Loutfi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wrede</surname>
          </string-name>
          ,
          <article-title>A Short Review of Symbol Grounding in Robotic and Intelligent Systems</article-title>
          , KI - Künstliche
          <source>Intelligenz</source>
          <volume>27</volume>
          (
          <year>2013</year>
          )
          <fpage>129</fpage>
          -
          <lpage>136</lpage>
          . doi:
          <volume>10</volume>
          .1007/s13218- 013- 0247- 2.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>K.</given-names>
            <surname>Gref</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. van Steenkiste</surname>
          </string-name>
          ,
          <source>J. Schmidhuber, On the Binding Problem in Artificial Neural Networks</source>
          , arXiv (
          <year>2020</year>
          ). URL: http://arxiv.org/abs/
          <year>2012</year>
          .05208.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>T. R.</given-names>
            <surname>Besold</surname>
          </string-name>
          , K.-U. Kühnberger,
          <string-name>
            <given-names>A. S. d.</given-names>
            <surname>Garcez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Safiotti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. H.</given-names>
            <surname>Fischer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bundy</surname>
          </string-name>
          ,
          <article-title>Anchoring knowledge in interaction: Towards a harmonic Subsymbolic/Symbolic framework and architecture of computational cognition</article-title>
          , in: J.
          <string-name>
            <surname>Bieger</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Goertzel</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Potapov (Eds.),
          <source>Artificial general intelligence</source>
          , volume
          <volume>9205</volume>
          of Lecture Notes in Computer Science,
          <year>2015</year>
          , pp.
          <fpage>35</fpage>
          -
          <lpage>45</lpage>
          . doi:
          <volume>10</volume>
          .1007/978- 3-
          <fpage>319</fpage>
          - 21365-
          <issue>1</issue>
          _
          <fpage>4</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T. R.</given-names>
            <surname>Besold</surname>
          </string-name>
          , A. S. d. Garcez,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bader</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Bowman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. M.</given-names>
            <surname>Domingos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hitzler</surname>
          </string-name>
          , K.-U. Kühnberger,
          <string-name>
            <given-names>L. C.</given-names>
            <surname>Lamb</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lowd</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. M. V.</given-names>
            <surname>Lima</surname>
          </string-name>
          , L. de Penning, G. Pinkas,
          <string-name>
            <given-names>H.</given-names>
            <surname>Poon</surname>
          </string-name>
          , G. Zaverucha,
          <article-title>Neural-symbolic learning and reasoning: A survey and interpretation</article-title>
          , arXiv (
          <year>2017</year>
          ). URL: http://arxiv.org/abs/1711.03902.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kaiser</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          , in: I. Guyon,
          <string-name>
            <given-names>U. V.</given-names>
            <surname>Luxburg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wallach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fergus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vishwanathan</surname>
          </string-name>
          , R. Garnett (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>30</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2017</year>
          , pp.
          <fpage>5998</fpage>
          -
          <lpage>6008</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C. P.</given-names>
            <surname>Burgess</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Matthey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Watters</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kabra</surname>
          </string-name>
          , I. Higgins,
          <string-name>
            <given-names>M.</given-names>
            <surname>Botvinick</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Lerchner,
          <source>MONet: Unsupervised Scene Decomposition and Representation</source>
          , arXiv (
          <year>2019</year>
          ). URL: http://arxiv.org/abs/
          <year>1901</year>
          . 11390.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kohli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. B.</given-names>
            <surname>Tenenbaum</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Wu,</surname>
          </string-name>
          <article-title>The Neuro-Symbolic Concept Learner: Interpreting Scenes, Words, and Sentences From Natural Supervision, in: 7th international conference on learning representations</article-title>
          ,
          <source>ICLR</source>
          <year>2019</year>
          ,
          <year>2019</year>
          . URL: https://openreview.net/forum?id=rJgMlhRctm.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Blazek</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. M. Lin</surname>
          </string-name>
          ,
          <article-title>A neural network model of perception and reasoning</article-title>
          , arXiv (
          <year>2020</year>
          ). URL: http://arxiv.org/abs/
          <year>2002</year>
          .11319.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>L. A. A.</given-names>
            <surname>Doumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Puebla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. E.</given-names>
            <surname>Hummel</surname>
          </string-name>
          ,
          <article-title>Relation learning in a neurocomputational architecture supports cross-domain transfer</article-title>
          , in: S. Denison,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. C.</surname>
          </string-name>
          Armstrong (Eds.),
          <source>Proceedings of the 42nd annual meeting of the cognitive science society</source>
          ,
          <source>CogSci</source>
          <year>2020</year>
          , Montreal,
          <year>2020</year>
          , pp.
          <fpage>932</fpage>
          -
          <lpage>937</lpage>
          . URL: https://cogsci.mindmodeling.org/2020/papers/0165/index.html.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M.</given-names>
            <surname>Garnelo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Arulkumaran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Shanahan</surname>
          </string-name>
          , Towards Deep Symbolic Reinforcement Learning, arXiv (
          <year>2016</year>
          ). URL: http://arxiv.org/abs/1609.05518.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>