<!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>A Proposal for Common Dataset in Neural-Symbolic Reasoning Studies</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ozgur Yilmaz</string-name>
          <email>ozyilmaz@turgutozal.edu.tr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Artur d'Avila Garcez</string-name>
          <email>a.garcez@city.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniel Silver</string-name>
          <email>danny.silver@acadiau.ca</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Turgut Ozal University, Computer Science Department, Ankara Turkey City University London, Department of Computer Science, London UK Acadia University, Jodrey School of Computer Science</institution>
          ,
          <addr-line>Nova Scotia</addr-line>
          <country country="CA">Canada</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>We promote and analyze the needs of a common publicly available benchmark dataset to be used for neural-symbolic studies of learning and reasoning. The recently released Visual Genome repository is proposed as a suitable dataset to meet these needs. Along with the original tasks that were suggested by the Visual Genome creators, we propose neural-symbolic tasks that can be used as challenges to promote research in the eld and competition between lab groups.</p>
      </abstract>
      <kwd-group>
        <kwd>Neural-symbolic computing</kwd>
        <kwd>common dataset</kwd>
        <kwd>relational learning</kwd>
        <kwd>reasoning</kwd>
        <kwd>visual entailment</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Research into neural-symbolic integration seeks to combine learning from
subsymbolic vector representations of data and concepts with symbolic reasoning
and knowledge representation. [4{7]. In order to integrate the sub-symbolic
neural representations of sensory data with the symbolic knowledge tools developed
within AI over the last 60 years of research, a mathematical toolbox has to
be designed that has the capability of translating between di erent levels of
knowledge representation. In its infancy, by comparison, neural-symbolic studies
are promising ventures towards an AI system which can recognize patterns in
sensory data and reason about such commonsense patterns and knowledge.</p>
      <p>
        The existence of a satisfactory dataset has been shown to be fruitful in many
computer science elds. It enables a fair comparison of existing approaches and
encourages competition. It should be mentioned also that benchmark datasets
introduce a potential bias, as problems not covered by the benchmark receive
less attention. Due to the growth of the web and abundance of data, ease of
annotation by crowd-sourcing and the desire to build accurate applications, many
large datasets have been developed within computer vision, such as ImageNet
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], Microsoft COCO [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and VQA [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The size of these datasets is large to
accommodate very complex models, speci cally deep neural networks, with the
promise of use as technological tools in everyday life such as image search and
retrieval, or image captioning for the visually impaired.
      </p>
      <p>Copyright © 2016 for this paper by its authors. Copying permitted for private and academic purposes.</p>
      <p>There are valuable experimental studies in neural-symbolic reasoning,
however there is a need for a common publicly-available benchmark dataset to
encourage progress and communications in the eld. Datasets exist in
Statistical Relational Learning (SRL) and Inductive Logic Programming (ILP) which
may be suitable for neural-symbolic integration. Recently developed datasets
for vision-language tasks such as image caption generation and visual
question answering seem attractive for neural-symbolic studies since they require
complex pattern recognition over images and symbol manipulation of language.</p>
      <p>Yet, symbol manipulation and reasoning are limited to image description text
that is unstructured, and not amenable to traditional natural language
processing (NLP) tools. The ideal dataset for neural-symbolic studies should include
a large and complex raw data set for sub-symbolic systems to learn e ective
and discriminative representations, as well as a formal representation of the raw
data (a knowledge-base in rst order logic) for symbolic systems to learn general
rules and perform logical inference. Existence of both complex sub-symbolic data
and its high level symbolic interpretation is essential for developing the
abovementioned translational methods between the two forms of representations which
are at the heart of neural-symbolic integration.</p>
      <p>
        In this paper, we propose the use of the Visual Genome dataset [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] as the
best challenge benchmark dataset for neural-symbolic integration. The dataset
is valuable \as is" towards the goals of neural-symbolic integration, however, we
also suggest additional features and challenge tasks for the dataset to meet a
wider range of research objectives within neural-symbolic computing.
      </p>
      <p>In Section 2, we recall the goals of neural-symbolic integration (NSI). In
Section 3, we describe the visual genome (VG) dataset. In Section 4, we list
existing applications of VG to NSI. In Section 5, we propose the new applications
and extensions, and in Section 6, we conclude the paper.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Neural-Symbolic Reasoning</title>
      <p>
        Neural-symbolic systems [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] integrate logical reasoning and statistical learning
by o ering sound translation algorithms between network and logic models. They
contain three main components: (1) knowledge encoding and reasoning in
neural networks, (2) knowledge evolution and network learning, and (3) knowledge
extraction from trained networks. In a neural-symbolic system, neural networks
provide the machinery for e cient computation and robust learning, while logic
provides high-level representations, reasoning and explanation capabilities to the
network models, promoting modularity, facilitating validation and maintenance
and enabling a better interaction with existing systems.
      </p>
      <p>Neural-symbolic systems have had important applications in diverse areas
such as bioinformatics, fraud prevention, assessment and training in simulators,
cognitive robotics, general game playing, image, audio and video classi cation,
software veri cation, and the semantic web. Nevertheless, a major challenge that
remains is how to e ectively bene t from both (i) robust statistical methods
that work well on real-valued vectors and (ii) rich and interpretable
representations which enable explanations to be reasoned about and transferred across
applications. The above requires the e ective translation of relational symbolic
knowledge for use by statistical methods which work well with vectors (without
the need for grounding all instances of the knowledge-base into the model of
choice) and the e ective extraction of compact and rich representations from
vector-based models following neural network learning.</p>
      <p>
        The emergence of symbolic representations is natural in any complex
domain associated with large collections of data. In fact, symbolic representations
seem critical to the solution of many interesting challenges involving big data.
Consider, for example, the recent AlphaGo experiment1 or the requirements of
life-long learning[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] or intelligent agents who interact with the environment. The
above is particularly relevant when neural-symbolic integration meets computer
1 https://www.technologyreview.com/s/601072/
ve-lessons-from-alphagos-historicvictory/
vision. As pointed out at a recent Dagstuhl seminar on neural-symbolic
computing 2, a serious challenge in the eld is the lack of speci cally relevant and
systematic evaluation mechanisms. The benchmark-based approach, which is
useful in some cases, is very limited in others, including the benchmarks used in
Statistical Relational Learning (SRL) and Inductive Logic Programming (ILP)
[
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]. In particular, when the goal is (i) to evaluate how well a system
integrates learning and reasoning, or (ii) to evaluate how useful or interpretable
the learned descriptions are, existing benchmarks fall short: SRL will tend to
ground all representation without a focus on rst-order reasoning; ILP tend not
to handle real-valued vectors or provide for robust learning. Neural-symbolic
systems seek to bene t from the knowledge representation and reasoning capacities
of logical symbolic representations, and the robust learning capacities of neural
networks, reconciling the logical nature of reasoning and the statistical nature of
learning [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The provision of a data challenge as proposed here should promote
the fair comparative evaluation of: (1) e ective learning from noisy data and (2)
reasoning about what has been learned.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Visual Genome</title>
      <p>
        Visual understanding is suggested to be an AI-complete problem [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], therefore
it is a challenging testbed for neural-symbolic studies. A genuine understanding
of a visual scene requires detecting objects, recognizing attributes of objects and
inferring their interactions and relationships. Understanding images thoroughly
requires a grounding of visual concepts onto language and a formalized
representation of the components of an image, as stated in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]: \existing models would
be able to detect discrete objects in a photo but would not be able to explain
their interactions or the relationships between them. Such explanations tend
to be cognitive in nature, integrating perceptual information into conclusions
about the relationships between objects in a scene...". Going from perceptual
to cognitive, from image to language, demands a range of operations that must
lift the representation from subsymbolic to symbolic, which it is at the core of
neural-symbolic computation studies.
      </p>
      <p>
        Similar to previous attempts on visual knowledge bases [14{16], the Visual
Genome provides a large set of images and annotations of image regions which
is formalized as a scene graph of objects and their relations. Images in the
dataset (see Figure 1) contain multiple image regions each having multiple object
instances. The attributes of object instances and their relationship (predicate)
with other objects are also recorded. Region graphs are combined to form a scene
graph of an image, which can be translated into a knowledge base, as well as
plain language using basic NLP tools. The concepts in the dataset can be linked
to existing knowledge in other datasets or systems because all objects, attributes
and relationships in each image in the Visual Genome can be mapped onto a
corresponding WordNet ID, called a synset ID [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. As described in the Visual
      </p>
      <sec id="sec-3-1">
        <title>2 http://www.dagstuhl.de/14381</title>
        <p>Genome project main webpage3, the dataset contains 108,249 images (with an
average image size of 500 pixels), 4.2 million region descriptions (with around
75,000 unique image objects), 1.7 million visual question-answers, 2.1 million
object instances, 1.8 million attributes (40,500 unique attributes), 1.8 million
relationships (40,500 unique relationships), 1.5 million object-object relationship
instances, 1.6 million attribute-object instances, 108,249 total scene graphs and
3,788,715 total region graphs.</p>
        <p>Therefore, visual genome contains a dense formal knowledge representation
of images suitable to be manipulated by symbolic computation approaches, as
well as sensory image data ready to be recognized and analyzed by
connectionist methods. For vision/language tasks, region descriptions and question-answer
pairs related to images are also provided. Overall the dataset enables a wide
range of scene understanding applications, which typically require high level
symbol manipulation and language processing. Furthermore, the symbolic
formalism contained in Visual Genome favors rst order logic representations and
relational learning. The scale of the dataset means that approaches which
perform grounding will probably be less e ective than truly relational approaches.
In other words, Visual Genome targets a major, arguably the most important,
open challenge in neural-symbolic integration: the e ective handling of learning
from real-valued vectors and reasoning from rich knowledge representations.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Existing Applications on the Visual Genome</title>
      <p>The developers of the dataset have introduced some interesting tasks, two of
which are explained below.
4.1</p>
      <sec id="sec-4-1">
        <title>Attribute and Relationship Prediction</title>
        <p>
          Object class prediction and object detection is at the center of computer
vision studies, and successful deep learning algorithms [
          <xref ref-type="bibr" rid="ref19 ref20">20, 19</xref>
          ] dominate the eld.
The Visual Genome enables dense and accurate attribute/predicate
estimation; bounding boxes that contain an object can be analyzed for predicting
attribute/predicate dimensions.
        </p>
        <p>
          Researchers have found that learning attribute-object class pairs for each
bounding box dramatically improves attribute prediction performance possibly
due to the unique association of some attributes with speci c object classes.
Similarly, learning subject class - predicate - object class triplets instead of
predicate only, can improve performance. This is again due to the fact that some
relationships occur only among a very small subset of objects classes (e.g. the
drive predicate accepts the person subject exclusively). Such applications can be
considered an instantiation of collective classi cation in relational learning [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ].
        </p>
        <sec id="sec-4-1-1">
          <title>3 https://visualgenome.org/</title>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>Caption Generation and Visual Question Answering</title>
        <p>
          The existence of region descriptions and question-answer pairs on images
facilitate vision-language processing tasks. The visual representation of images and
regions can be used in a generative architecture to produce syntactically and
semantically correct text such as automated image caption generation. Recurrent
neural network algorithms have been deployed successfully [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] for such
visionlanguage applications. However, a major challenge has been judging performance
accuaracy of automated image captioning, e.g. is \A cat is beside a dog under a
parked car" the same as \A car is parked over a dog and a cat"?
4.2
5
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Suggested Applications and Extensions</title>
      <p>Visual Genome holds a very rich representation of the visual world, ready to be
exploited by cognitive tasks. We envision that the dataset can be used for a wide
set of experimental paradigms, or can be extended by additional crowd-sourced
annotations as required. We provide a set of novel tasks, which is not meant to be
exhaustive. Along with the task de nitions, we provide a high level algorithmic
description of how to tackle them in order to illustrate how neural-symbolic
studies would bene t from the dataset.</p>
      <p>Generally, neural-symbolic approaches would ground the sensory data onto
symbols and manipulate those, or perform vector algebra on neural
representations to form a hierarchy of concepts and rules on the vector space. The main
questions are how to accurately and e ectively ground the data or how to
manipulate the vectors as done with symbols in AI, as well as how to use both
mathematical tools simultaneously.
5.1</p>
      <sec id="sec-5-1">
        <title>Visual Entailment</title>
        <p>
          Comprehension of entailment and contradiction in sentences is an important
part of language processing. In textual entailment tasks, two sentences need
to be understood and the system has to decide whether they contradict each
other, they are neutral (unrelated) or they entail each other. The scene graph
in Visual Genome is already a valuable asset in the textual entailment task, as
utilized in a study in [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], yet there is much more to be done. We propose a new
task called visual entailment in which images, relationships and scene graphs are
used to detect entailment and contradictions. This is a very natural use of the
image representation for neural-symbolic tasks: inference can be performed at
the symbolic level if images are grounded onto class and attribute predictions by
a classi er, or inference can be partly done at the sub-symbolic level using the
neural representations of images. Sub-symbolic computation requires an algebra
on semantically meaningful vector representations [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ].
        </p>
        <p>We present two image bounding boxes, then ask whether there is
entailment/contradiction/neutralism. The decision is very much related to the
possible relationships between image boxes. If there is a relationship then the answer
is entailment, if not, it can be neutral or contradiction, depending on the
compatibility with commonsense. A car and a tire imply entailment, a car and a
house window may be neutral but a car and a kitchen sink is probably a
contradiction. The output can be set to a range between -1 (contradiction) and 1
(entailment), at which point the supervised learning may become a regression
task instead of classi cation. It should be noted that visual entailment aims at
nding relationships between two scenes thus the proposed task is closely related
to link prediction in relational learning, where the goal is to learn the existence
of a relationship. Therefore, the idea of contradiction in visual entailment means
learning the lack of a relationship, which is not the case in textual entailment
task.</p>
        <p>
          The task becomes even more interesting and similar to textual entailment
if we allow one or two of the image boxes to be a large region with multiple
objects and relationships in it. Then the system needs to analyze the congruence
of region graphs, hence knowledge bases. A subsymbolic approach would use
neural embeddings of the image boxes to generate rules of entailment on the
vector space possibly using a vector symbolic architecture [
          <xref ref-type="bibr" rid="ref23 ref24">23, 24</xref>
          ] and/or an
attention-memory computation framework [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. A symbolic approach would use
the class/attribute/relationship predictors to go up to knowledge base level.
5.2
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>Scene Graph Estimation</title>
        <p>
          Possibly the hardest task is generating the scene graph of an image because the
graph holds the complete high level information regarding the image, we need
to go from the sensory to the most complete cognitive level. It requires to
focus on speci c bounding boxes in the image, estimate object/attribute labels
and jump to other image boxes while predicting relationships between them.
Thus the graph can be built part by part possibly with multiple passes on the
same image region. These multiple passes can possibly be hierarchical in nature,
extracting graph structure from coarse to ne details. This work ow resembles
the strategy of recurrent architectures with attention-memory mechanisms[
          <xref ref-type="bibr" rid="ref26">26</xref>
          ].
Another strategy more in the avor of neural-symbolic computation would be
training the system by encoding regions and scenes in the training dataset with
xed length vector representations and forming a \graph knowledge-base", then
matching the test region with the knowledge base to obtain the most
representative and similar region description in the training set. After this initial
estimation, ne-tuning can optionally be done with the recurrent architectures
with attention-memory mechanisms.
        </p>
        <p>
          The main challenge in this task is related to the variable binding problem:
multiple instances of the same object/concept/relationship as it appears in
different times and context need to reuse a common function with possibly di erent
values. One possible solution to this problem is transferring learned
representation across di erent contexts [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ].
        </p>
      </sec>
      <sec id="sec-5-3">
        <title>Visual Rule Extraction and Analogy</title>
        <p>
          Is it possible to mine the scene graphs for extracting logical clauses such as
\If Man not(Standing) Then Man SitsOn(Something)"? This capability is
essential for forming the visual commonsense knowledge mentioned earlier. In a
similar avor, visual analogies can be made such as \Leg is to Man as Tire is
to Car". These are strictly in the domain of symbolic computation when images
are grounded to class/attributes and predicate predictions are processed in the
scene graph. However, what if we wanted to retrieve rules and analogies directly
using image portions? Then, neural representations of images would need to be
processed to harvest conditional and analogical \statements" at the sub-symbolic
level [
          <xref ref-type="bibr" rid="ref27 ref29 ref34">27, 29, 34</xref>
          ]. The rules and analogies that form the commonsense knowledge
and representations of the images are expected to live on the same space, which
is essential for combining connectionist and symbolic capabilities. Visual rule
extraction can also be tackled with inductive bias transfer of neural networks
across di erent task domains [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ]. More interesting approaches would be again
hybrid ones that utilizes the symbolic mechanisms along with vector algebra.
5.4
        </p>
      </sec>
      <sec id="sec-5-4">
        <title>Collective Classi cation</title>
        <p>
          Another relevant relational learning task is collective classi cation: simultaneous
prediction of the class of several object bounding boxes in a region given their
attributes or relations. This is super cially similar to attribute and relation
prediction tasks already examined in [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], yet the proposed task is not bounded
by pairwise bounding box queries but all the objects in a region or even in a
whole image can be considered for a more challenging collective classi cation.
This is directly related with multiple task learning and inductive bias transfer
between many tasks, as studied from a neural-symbolic perspective in [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ].
5.5
        </p>
      </sec>
      <sec id="sec-5-5">
        <title>Unsupervised co-training of a subject class - predicate - object class using images and symbols</title>
        <p>Related to prior work discussed in Section 4.1 is the unsupervised co-training
of subject class - predicate - object class triples using both image data as well
as symbolic logic. The intention is to show that one can learn an unsupervised
generative model (e.g. stacked Restricted Boltzmann Machines) that are
capable of reconstructing the images given the symbols, and the symbols given the
images. Here, symbols could be represented as combinations of textual inputs or
as images themselves.
We have proposed Visual Genome as a challenge and benchmark dataset for
neural-symbolic integration. Along with the original tasks that were suggested
by the Visual Genome creators, we also identify tasks speci c for neural-symbolic
integration, in particular combining learning from real-valued vectors and
reasoning from rich relational knowledge representations, to promote research in
the eld and competition between lab groups.</p>
        <p>Acknowledgments. We would like to thank the reviewers for detailed and very
bene cial comments on the paper. Ozgur Yilmaz is supported by The Scienti c
and Technological Research Council of Turkey (TUBI_TAK) Career Grant, No:
114E554.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Olga</given-names>
            <surname>Russakovsky</surname>
          </string-name>
          , Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng Huang, Andrej Karpathy, Aditya Khosla,
          <string-name>
            <given-names>Michael</given-names>
            <surname>Bernstein</surname>
          </string-name>
          , et al.
          <article-title>Imagenet large scale visual recognition challenge</article-title>
          .
          <source>International Journal of Computer Vision</source>
          ,
          <volume>115</volume>
          (
          <issue>3</issue>
          ):
          <volume>211</volume>
          {
          <fpage>252</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Tsung-Yi Lin</surname>
            ,
            <given-names>Michael</given-names>
          </string-name>
          <string-name>
            <surname>Maire</surname>
            , Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollar, and
            <given-names>C</given-names>
          </string-name>
          <string-name>
            <surname>Lawrence</surname>
          </string-name>
          <article-title>Zitnick</article-title>
          .
          <article-title>Microsoft coco: Common objects in context</article-title>
          .
          <source>In Computer Vision{ECCV</source>
          <year>2014</year>
          , pages
          <fpage>740</fpage>
          {
          <fpage>755</fpage>
          . Springer,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Stanislaw</given-names>
            <surname>Antol</surname>
          </string-name>
          , Aishwarya Agrawal, Jiasen Lu, Margaret Mitchell, Dhruv Batra,
          <string-name>
            <given-names>C Lawrence</given-names>
            <surname>Zitnick</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Devi</given-names>
            <surname>Parikh</surname>
          </string-name>
          . Vqa:
          <article-title>Visual question answering</article-title>
          .
          <source>In Proceedings of the IEEE International Conference on Computer Vision</source>
          , pages
          <volume>2425</volume>
          {
          <fpage>2433</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Tarek R Besold</surname>
          </string-name>
          and
          <article-title>Kai-Uwe Kuhnberger. Towards integrated neural{symbolic systems for human-level AI: Two research programs helping to bridge the gaps</article-title>
          .
          <source>Biologically Inspired Cognitive Architectures</source>
          ,
          <volume>14</volume>
          :
          <fpage>97</fpage>
          {
          <fpage>110</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Artur S. d'Avila Garcez</surname>
          </string-name>
          , Luis C Lamb, and
          <string-name>
            <surname>Dov M Gabbay.</surname>
          </string-name>
          Neural-symbolic
          <source>cognitive reasoning. Springer Science &amp; Business Media</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Sebastian</given-names>
            <surname>Bader</surname>
          </string-name>
          and
          <string-name>
            <given-names>Pascal</given-names>
            <surname>Hitzler</surname>
          </string-name>
          .
          <article-title>Dimensions of neural-symbolic integration-a structured survey</article-title>
          .
          <source>arXiv preprint cs/0511042</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Artur S. d'Avila Garcez</surname>
          </string-name>
          , Tarek R Besold, Luc de Raedt, Peter Foldiak, Pascal Hitzler, Thomas Icard,
          <string-name>
            <surname>Kai-Uwe Ku</surname>
          </string-name>
          hnberger, Luis C Lamb,
          <string-name>
            <surname>Risto Miikkulainen</surname>
          </string-name>
          , and Daniel L Silver.
          <article-title>Neural-symbolic learning and reasoning: contributions and challenges</article-title>
          .
          <source>In Proceedings of the AAAI Spring Symposium on Knowledge Representation and Reasoning: Integrating Symbolic and Neural Approaches</source>
          , Stanford,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Artur S. d'Avila Garcez</surname>
            , Lu s
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Lamb</surname>
          </string-name>
          , and
          <string-name>
            <surname>Dov</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Gabbay</surname>
          </string-name>
          .
          <source>Neural-Symbolic Cognitive Reasoning. Cognitive Technologies</source>
          . Springer,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9. Daniel L Silver,
          <string-name>
            <surname>Qiang Yang</surname>
            , and
            <given-names>Lianghao</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>Lifelong machine learning systems: Beyond learning algorithms</article-title>
          . In in AAAI Spring Symposium Series. Citeseer,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Leslie</surname>
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Valiant</surname>
          </string-name>
          .
          <article-title>Knowledge infusion</article-title>
          .
          <source>In Proceedings, The Twenty-First National Conference on Arti cial Intelligence and the Eighteenth Innovative Applications of Arti cial Intelligence Conference, July 16-20</source>
          ,
          <year>2006</year>
          , Boston, Massachusetts, USA, pages
          <volume>1546</volume>
          {
          <fpage>1551</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>Jue</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <surname>Pedro M. Domingos</surname>
          </string-name>
          .
          <article-title>Hybrid markov logic networks</article-title>
          .
          <source>In Proceedings of the Twenty-Third AAAI Conference on Arti cial Intelligence</source>
          ,
          <source>AAAI</source>
          <year>2008</year>
          , Chicago, Illinois, USA, July
          <volume>13</volume>
          -
          <issue>17</issue>
          ,
          <year>2008</year>
          , pages
          <fpage>1106</fpage>
          {
          <fpage>1111</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. Luc De Raedt, Kristian Kersting, Sriraam Natarajan, and David Poole.
          <source>Statistical Relational Arti cial Intelligence: Logic</source>
          , Probability, and
          <string-name>
            <surname>Computation</surname>
          </string-name>
          .
          <source>Synthesis Lectures on Arti cial Intelligence and Machine Learning</source>
          . Morgan &amp; Claypool Publishers,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Ranjay</surname>
            <given-names>Krishna</given-names>
          </string-name>
          , Yuke Zhu, Oliver Groth, Justin Johnson, Kenji Hata, Joshua Kravitz, Stephanie Chen, Yannis Kalanditis,
          <string-name>
            <surname>Li-Jia</surname>
            <given-names>Li</given-names>
          </string-name>
          ,
          <string-name>
            <surname>David A Shamma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Michael</given-names>
            <surname>Bernstein</surname>
          </string-name>
          , and
          <string-name>
            <surname>Li</surname>
          </string-name>
          Fei-Fei.
          <article-title>Visual genome: Connecting language and vision using crowdsourced dense image annotations</article-title>
          .
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Yuke</surname>
            <given-names>Zhu</given-names>
          </string-name>
          , Ce Zhang, Christopher Re, and
          <string-name>
            <surname>Li</surname>
          </string-name>
          Fei-Fei.
          <article-title>Building a large-scale multimodal knowledge base system for answering visual queries</article-title>
          .
          <source>arXiv preprint arXiv:1507.05670</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Xinlei</surname>
            <given-names>Chen</given-names>
          </string-name>
          , Abhinav Shrivastava, and
          <string-name>
            <given-names>Abhinav</given-names>
            <surname>Gupta</surname>
          </string-name>
          . Neil:
          <article-title>Extracting visual knowledge from web data</article-title>
          .
          <source>In Proceedings of the IEEE International Conference on Computer Vision</source>
          , pages
          <volume>1409</volume>
          {
          <fpage>1416</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Fereshteh</surname>
            <given-names>Sadeghi</given-names>
          </string-name>
          ,
          <article-title>Santosh K Divvala,</article-title>
          and
          <string-name>
            <given-names>Ali</given-names>
            <surname>Farhadi</surname>
          </string-name>
          . Viske:
          <article-title>Visual knowledge extraction and question answering by visual veri cation of relation phrases</article-title>
          .
          <source>In 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          , pages
          <fpage>1456</fpage>
          {
          <fpage>1464</fpage>
          . IEEE,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>Dafna</given-names>
            <surname>Shahaf</surname>
          </string-name>
          and
          <string-name>
            <given-names>Eyal</given-names>
            <surname>Amir</surname>
          </string-name>
          .
          <article-title>Towards a theory of ai completeness</article-title>
          .
          <source>In AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning</source>
          , pages
          <volume>150</volume>
          {
          <fpage>155</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>George</surname>
            <given-names>A</given-names>
          </string-name>
          <string-name>
            <surname>Miller</surname>
          </string-name>
          .
          <article-title>Wordnet: a lexical database for english</article-title>
          .
          <source>Communications of the ACM</source>
          ,
          <volume>38</volume>
          (
          <issue>11</issue>
          ):
          <volume>39</volume>
          {
          <fpage>41</fpage>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Ross</surname>
            <given-names>Girshick</given-names>
          </string-name>
          , Je Donahue, Trevor Darrell, and
          <string-name>
            <given-names>Jitendra</given-names>
            <surname>Malik</surname>
          </string-name>
          .
          <article-title>Rich feature hierarchies for accurate object detection and semantic segmentation</article-title>
          .
          <source>In Proceedings of the IEEE conference on computer vision andpattern recognition</source>
          , pages
          <volume>580</volume>
          {
          <fpage>587</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <article-title>Alex Krizhevsky and Geo rey Hinton. Learning multiple layers of features from tiny images</article-title>
          . Computer Science Department, University of Toronto,
          <source>Tech. Rep</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>Andrej</given-names>
            <surname>Karpathy</surname>
          </string-name>
          and
          <string-name>
            <given-names>Li</given-names>
            <surname>Fei-Fei</surname>
          </string-name>
          .
          <article-title>Deep visual-semantic alignments for generating image descriptions</article-title>
          .
          <source>In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source>
          , pages
          <volume>3128</volume>
          {
          <fpage>3137</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Samuel R Bowman</surname>
            , Gabor Angeli, Christopher Potts, and
            <given-names>Christopher D</given-names>
          </string-name>
          <string-name>
            <surname>Manning</surname>
          </string-name>
          .
          <article-title>A large annotated corpus for learning natural language inference</article-title>
          .
          <source>arXiv preprint arXiv:1508.05326</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Simon</surname>
            <given-names>D Levy</given-names>
          </string-name>
          and
          <string-name>
            <given-names>Ross</given-names>
            <surname>Gayler</surname>
          </string-name>
          .
          <article-title>Vector symbolic architectures: A new building material for arti cial general intelligence</article-title>
          .
          <source>In Proceedings of the 2008 conference on Arti cial General Intelligence 2008: Proceedings of the First AGI Conference</source>
          , pages
          <volume>414</volume>
          {
          <fpage>418</fpage>
          . IOS Press,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24. Je Mitchell and
          <string-name>
            <given-names>Mirella</given-names>
            <surname>Lapata</surname>
          </string-name>
          .
          <article-title>Vector-based models of semantic composition</article-title>
          .
          <source>In ACL</source>
          , pages
          <volume>236</volume>
          {
          <fpage>244</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Ivo</surname>
            <given-names>Danihelka</given-names>
          </string-name>
          , Greg Wayne, Benigno Uria, Nal Kalchbrenner, and
          <string-name>
            <given-names>Alex</given-names>
            <surname>Graves</surname>
          </string-name>
          .
          <article-title>Associative long short-term memory</article-title>
          .
          <source>arXiv preprint arXiv:1602.03032</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Sainbayar</surname>
            <given-names>Sukhbaatar</given-names>
          </string-name>
          , Jason Weston,
          <string-name>
            <given-names>Rob</given-names>
            <surname>Fergus</surname>
          </string-name>
          , et al.
          <article-title>End-to-end memory networks</article-title>
          .
          <source>In Advances in Neural Information Processing Systems</source>
          , pages
          <fpage>2431</fpage>
          {
          <fpage>2439</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <given-names>Ozgur</given-names>
            <surname>Yilmaz</surname>
          </string-name>
          .
          <article-title>Symbolic computation using cellular automata-based hyperdimensional computing</article-title>
          .
          <source>Neural computation</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28. Daniel L Silver.
          <article-title>The parallel transfer of task knowledge using dynamic learning rates based on a measure of relatedness</article-title>
          .
          <source>Connection Science</source>
          ,
          <volume>8</volume>
          (
          <issue>2</issue>
          ):
          <volume>277</volume>
          {
          <fpage>294</fpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <given-names>Ozgur</given-names>
            <surname>Yilmaz</surname>
          </string-name>
          .
          <article-title>Analogy making and logical inference on images using cellular automata based hyperdimensional computing</article-title>
          .
          <source>In Advances in Neural Information Processing Systems, Cognitive Computation Workshop</source>
          , pages
          <fpage>1</fpage>
          <issue>{9</issue>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30. Daniel L Silver.
          <article-title>Selective functional transfer: Inductive bias from related tasks</article-title>
          .
          <source>In IASTED International Conference on Arti cial Intelligence and Soft Computing (ASC2001)</source>
          . Citeseer,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31. Daniel L Silver and
          <string-name>
            <given-names>Liangliang</given-names>
            <surname>Tu</surname>
          </string-name>
          .
          <article-title>Image transformation: inductive transfer between multiple tasks having multiple outputs</article-title>
          .
          <source>In Advances in Arti cial Intelligence</source>
          , pages
          <fpage>296</fpage>
          {
          <fpage>307</fpage>
          . Springer,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Prithviraj</surname>
            <given-names>Sen</given-names>
          </string-name>
          , Galileo Mark Namata, Mustafa Bilgic, Lise Getoor,
          <article-title>Brian Gallagher and Tina Eliassi-Rad. Collective Classi cation in Network Data</article-title>
          .
          <source>AI Magazine</source>
          ,
          <volume>3</volume>
          (
          <issue>29</issue>
          ):
          <volume>93</volume>
          {
          <fpage>106</fpage>
          .
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Luciano</surname>
          </string-name>
          <article-title>Sera ni and Artur S. d'Avila Garcez. Logic Tensor Networks: Deep Learning and Logical Reasoning from Data and Knowledge</article-title>
          .
          <source>arXiv preprint arXiv:1606.04422</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34. Tarek Richard Besold,
          <article-title>Kai-Uwe Kuhnberger, Artur S. d'Avila Garcez, Alessandro Sa otti</article-title>
          ,
          <string-name>
            <surname>Martin</surname>
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Fischer</surname>
            and
            <given-names>Alan</given-names>
          </string-name>
          <string-name>
            <surname>Bundy</surname>
          </string-name>
          .
          <article-title>Anchoring Knowledge in Interaction: Towards a Harmonic Subsymbolic/Symbolic Framework and Architecture of Computational Cognition</article-title>
          .
          <source>Arti cial General Intelligence - 8th International Conference, AGI</source>
          <year>2015</year>
          ,
          <article-title>AGI 2015</article-title>
          , Berlin, Germany,
          <source>July 22-25</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>