<!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>
      <article-id pub-id-type="doi">10.1109/EuroSP51992.2021.00024</article-id>
      <title-group>
        <article-title>Towards Quality-of-Service Metrics for Symbolic Knowledge Injection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andrea Agiollo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrea Rafanelli</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrea Omicini</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dipartimento di Informatica - Scienza e Ingegneria (DISI), Alma Mater Studiorum-Università di Bologna</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Dipartimento di Informatica, Università di Pisa</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <volume>12688</volume>
      <fpage>0000</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>The integration of symbolic knowledge and sub-symbolic predictors represents a recent popular trend in AI. Among the set of integration approaches, Symbolic Knowledge Injection (SKI) proposes the exploitation of human-intelligible knowledge to steer sub-symbolic models towards some desired behaviour. The vast majority of works in the field of SKI aim at increasing the predictive performance of the sub-symbolic model at hand and, therefore, measure SKI strength solely based on performance improvements. However, a variety of artefacts exist that afect this measure, mostly linked to the quality of the injected knowledge and the underlying predictor. Moreover, the use of injection techniques introduces the possibility of producing more eficient sub-symbolic models in terms of computations, energy, and data required. Therefore, novel and reliable Quality-of-Service (QoS) measures for SKI are clearly needed, aiming at robustly identifying the overall quality of an injection mechanism. Accordingly, in this work, we propose and mathematically model the first - up to our knowledge - set of QoS metrics for SKI, focusing on measuring injection robustness and eficiency gain.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;symbolic knowledge injection</kwd>
        <kwd>quality of service</kwd>
        <kwd>eficiency</kwd>
        <kwd>understandability</kwd>
        <kwd>robustness</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Recently, the proposal of machine and deep learning (ML &amp; DL) approaches gave rise to the new
artificial intelligence (AI) spring. This increased interest in AI solutions is due to groundbreaking
performance that data-driven ML approaches show against manually-defined approaches. Here,
humanly-designed models semi-automatically learn task-solving procedures from data via some
sort of optimisation mechanism. The variety of tasks which can be tackled in a data-driven way
is nearly unlimited, depending on the model and optimisation procedure proposed, and ranges
from text [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] to speech [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], image recognition [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], and many more.
      </p>
      <p>
        ML algorithms usually rely on numeric processing of data, aiming at detecting
statisticallyrelevant patterns such as correlation between variables or regularities in the data. Such an
approach proved successful both in terms of obtained performance and flexibility. Indeed, it
requires only to identify the data processing mechanism and its optimisation. However,
datadriven approaches – and especially DL ones – do not represent “silver bullet” sorts of solutions,
as they usually sufer from interpretability issues. Indeed, most popular modern AI solutions
exploit sub-symbolic predictors – such as neural networks (NNs) – which are black-box models.
We here define interpretability as the property of a predictor that enables an expert human
user to contemplate it and understand its behaviour. This property represents a fundamental
requirement in many applications where humans must be in full control of the computational
systems supporting their decisions, such as e-health [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] or smart transportation systems [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Recently, few works propose to fix this issue through the integration of symbolic knowledge
and sub-symbolic predictors [
        <xref ref-type="bibr" rid="ref6 ref7 ref8">6, 7, 8</xref>
        ]. Among them, few popular approaches propose to inject
symbolic knowledge – where “symbolic” refers to the way knowledge is represented – into
sub-symbolic predictors [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ]. We consider as symbolic any intelligible language which is
naturally interpretable for both human beings and computers. This includes a number of
logic formalisms, and excludes the fixed-sized tensors of numbers commonly exploited in
subsymbolic ML. Therefore, Symbolic Knowledge Injection (SKI) mechanisms propose to leverage
human comprehensible information and steer the training process of sub-symbolic predictors
towards desirable behaviours. Thus, SKI increases the degree of control over a sub-symbolic
predictor and its behaviour, constraining it with human-like common-sense.
      </p>
      <p>
        SKI approaches usually measure the quality of their injection mechanism simply in terms
of performance gain over a standard ML counterpart [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ]. While being a valid metric,
the performance gain is tightly linked with few injection artefacts—analysed in Section 3.1.
Therefore, there exist the necessity of identifying a set of Quality-of-Service (QoS) metrics for
SKI which analyse thoroughly its improvements over standard ML approaches. In this position
paper, we propose the first set of novel performance metrics for evaluating SKI mechanisms.
More in detail, we first focus on the injection quality, aiming to identify possible suitable metrics
to decouple the injection quality from the artefacts that usually characterise SKI (see Section 3.2).
We then highlight possible eficiency gains that SKI may obtain against standard – non SKI –
approaches (see Section 3.3), focusing on the definition of diferent eficiency measures such as
energy, memory and data savings. Finally, we analyse the diferent realms that may benefit from
measurements of the proposed metrics in SKI, obtaining a taxonomy of SKI QoS—Section 4.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Background &amp; Definitions</title>
      <p>
        Given the black-box nature of sub-symbolic predictors and their fuzzy optimisation procedure,
several recent works propose to leverage symbolic knowledge to steer the model towards
desired behaviour(s) [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ]. The underlying idea is for the sub-symbolic model to keep some
symbolic knowledge into account when drawing its predictions, thus making the sub-symbolic
mechanism more intelligible to humans. Instead, since it relies on a rather trivial concept,
SKI requires the definition of injection mechanisms that may depend on the model at hand
and the desired symbolic knowledge. Therefore, it is complex to define SKI in detail; rather,
we can describe it broadly as any algorithmic procedure afecting how sub-symbolic predictors
draw their inferences in such a way that predictions are either computed as a function of, or made
consistent with, some given symbolic knowledge. Formally, given an injection procedure ℐ, a
knowledge base (KB) , and a sub-symbolic model  aiming at solving task  , we define the
knowledge-aware model as the result of the application of  through ℐ over  . Mathematically,
we refer to this model as  (, ℐ,  ), while we identify its uneducated counterpart simply as
 ( ). We use "uneducated" to identify the sub-symbolic model used in the SKI approach, but
unaware of the symbolic knowledge.
      </p>
      <p>
        Depending on the SKI approach at hand, diferent type of symbolic knowledge, injection
mechanism, and targeted model may appear. Indeed, popular SKI mechanisms either rely on
logic formulae – adhering to either FOL or some of its subsets – or expert knowledge that represent
the humanly interpretable notions. Meanwhile, concerning the targeted model, SKI approaches
usually focus on NNs and their variations, due to their flexibility and success. Noticeably, the
injection mechanism character represents the most variable one, where diferent SKI proposals
rely on their unique characterisation. Indeed, the most popular set of these mechanisms aim
at injecting the knowledge at hand via constraining the learning process of the sub-symbolic
model, usually modifying the loss function [
        <xref ref-type="bibr" rid="ref10 ref11 ref9">9, 10, 11</xref>
        ]. Meanwhile, other popular approaches aim
at constructing sub-symbolic models in such a way that the NN structure reflects the knowledge
to inject [
        <xref ref-type="bibr" rid="ref12 ref13 ref14 ref15 ref6">12, 13, 6, 14, 15</xref>
        ]. Embedding approaches also represent a popular solution in this
realm, aiming at converting symbolic knowledge into numeric-array form to be used as extra
training data [
        <xref ref-type="bibr" rid="ref16">16, 17, 18</xref>
        ].
      </p>
      <p>It is common for works in the SKI realm to measure the strength of their mechanism as
the gain in performance that is achieved by the SKI model against its uneducated counterpart.
Mathematically, the efectiveness of the injection mechanism ℐ is measured as:
ℰ (ℐ) = ( ,  ) −  ( ,  )
(1)
where (, ) measures the performance – accuracy, F1-score, MSE, etc. – of a model  over a
task . While being indicative of the quality of the SKI approach, such metric does not grasp
every aspect of the injection mechanism, as there exist multiple artefacts that may afect ℰ (ℐ)
(see Section 3.1). Consequently, it is necessary to define reliable measures for measuring the
performance of the injection mechanism in SKI. Moreover, due to the sudden rise in research
interest towards sustainable AI approaches [19], there exist the opportunity to analyse if and
how SKI brings benefit in terms of computations, energy and data required to train and deploy
sub-symbolic approaches.</p>
    </sec>
    <sec id="sec-3">
      <title>3. SKI Quality-of-Service Metrics Definition</title>
      <p>In this section we propose and analyse a novel set of metrics for identifying the quality of SKI
systems. The overview, along with a brief classification, of the pinpointed metrics is proposed
in Section 3.1, distinguishing between eficiency-related metrics and injection-quality ones.
In Section 3.2 we then present a set of qualitative metrics aiming at measuring the quality of
the injection process by itself. Finally, we focus on eficiency-related metrics in Section 3.3,
presenting a list of suitable measures.</p>
      <sec id="sec-3-1">
        <title>3.1. Overview</title>
        <p>Most, if not all, of the proposed SKI mechanisms rely exclusively on measuring predictions
quality improvements over an equivalent uneducated counterpart to show their strength. However,
predictions quality and the corresponding improvements do not depend solely on the quality of
the injection mechanism at hand. Indeed, there exist multiple artefacts that might influence the
outcome quality of SKI tools. To name a few:
A1 — Knowledge quality and coverage. Highly detailed and target specific a-priori knowledge
usually bear higher quality to the overall injection mechanism, resulting in improved
performance gains. While being trivial, this aspect attains paramount importance in
SKI quality measurements and is usually ignored by SKI proposals. Indeed, diferent
SKI approaches rely on diferent KBs to tackle similar, if not identical, tasks. Therefore,
decoupling the quality measurements of the injection mechanism from the knowledge
quality is complex and represents an open issue.</p>
        <p>A2 — Baseline mechanism quality. Relying on injection, SKI approaches build on top of
subsymbolic models with variable levels of performance. Therefore, performance gains
of a SKI mechanism might vary significantly when switching between underlying
subsymbolic models.</p>
        <p>A3 — Task at hand. Depending on the complexity and nature of the considered task, knowledge
injection may bear diferent levels of benefit. Generally speaking, more complex tasks
should profit more than trivial ones.</p>
        <p>Taking into account the amount of artefacts that might alter the outcome quality of SKI
mechanisms, it is trivial to understand that solely measuring performance improvements represents a
dreadful choice and is a no-go. Moreover, the application of injection techniques in sub-symbolic
systems might introduce a set of advantages diferent from sole performance improvements
that are usually ignored by previous works. More in detail, we theorise that the use of SKI
enables reducing the amount of data and energy required to optimise the model at hand. The
underlying idea behind such hypothesis is that part of the thought process that the
uneducated system would need to learn from data-driven optimisation is displaced to the a-priori
knowledge in SKI frameworks. Indeed, the injected knowledge can be used either as guideline
or as foundations for the learning process of the sub-symbolic model, therefore reducing the
amount of knowledge load that the system must learn. Furthermore, injection mechanisms
may aid in terms of model’s explainability. Indeed, SKI relies on a-priori knowledge to steer
the sub-symbolic model learning towards a desirable behaviour or behavioural boundaries. We
here speculate that such steering process should produce more explainable models—or at least
understandable ones. Therefore, we propose to evaluate SKI mechanisms depending on their
ability to produce simpler, better explainable models. The underlying assumption is that one
of the issues with explaining sub-symbolic models is their unpredictable behaviour, usually
expressed as instability [20].</p>
        <p>To solve the issues concerning SKI quality measurements, we here propose six novel metrics,
taking into account diferent aspects of SKI mechanisms. More in detail, we propose to classify
these set of measures into two classes:
Injection quality metrics — This family of metrics represents the theoretical measures aiming
at analysing the quality achieved by the injection procedure by itself, decoupling it from
the set of artefacts (A1-A3) that commonly afect SKI.</p>
        <p>Eficiency metrics — This family of metrics aims at analysing how much SKI helps achieving
more eficient sub-symbolic models. Here, the eficiency term bears a wide-ranging
meaning, from computational eficiency to data-usage eficiency, and is discussed thoroughly
in Section 3.3.</p>
        <p>SKI QoS</p>
        <sec id="sec-3-1-1">
          <title>Injection</title>
        </sec>
        <sec id="sec-3-1-2">
          <title>Quality</title>
        </sec>
        <sec id="sec-3-1-3">
          <title>Robustness</title>
        </sec>
        <sec id="sec-3-1-4">
          <title>Comprehensibility</title>
        </sec>
        <sec id="sec-3-1-5">
          <title>Efficiency</title>
        </sec>
        <sec id="sec-3-1-6">
          <title>Memory</title>
        </sec>
        <sec id="sec-3-1-7">
          <title>Footprint</title>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Injection QoS</title>
        <p>We here analyse the quality of an injection mechanism ℐ belonging to a SKI framework, aiming
to remove the efect of artefacts A1-A3. The proposed metrics are:
Robustness — i.e., the capability of the injection mechanism to adapt to variations of input
data and knowledge.</p>
        <p>Comprehensibility — i.e., the capability of the injection mechanism to produce more
intelligible models.</p>
        <p>Insights regarding both metrics are also provided, highlighting possible issues, such as the
subjective nature of the comprehensibility metric which makes it dificult to formulate
mathematically. Therefore, the proposed metrics represent a first step towards a precise and clear-cut
formalisation of injection quality.
3.2.1. Robustness
Well-performing models are generalisable, as they are capable of producing strong predictions
on unseen data. Model generalisability is tightly connected with its robustness as defined in
counterfactual explanations approaches [21, 20]. Indeed, counterfactual explanations propose
to leverage input variations that cause the system to behave diferently to reveal possible
interesting behaviour of the analysed model. In essence, the rationale behind counterfactual
methods is to use perturbations of the input to identify certain invariant characteristics of the
counterfactual analysis, which may have causal relevance to the predicted phenomena—for
a overview of these approaches, please refer to [22]. We introduce the concept of statistical
robustness, which involves altering the input data in a manner analogous to counterfactual
analysis and define a robust estimator as one whose validity is unafected by the violation of its
initial assumptions. Similarly, we define an injection mechanism to be robust if its prediction
ability is not altered much when a slight perturbation is applied to the injected knowledge
or input data. Therefore, we first need to identify possible perturbations to be applied after
knowledge injection, namely:
Injected knowledge perturbation — We here aim at determining whether the introduction
of a slight perturbation  to the injected knowledge results in a significant change to the
model predictions. In other words, we are most interested in understanding the reliability
of the injection mechanism. Mathematically, we define a knowledge perturbation as
 =  + 
 ∼  (, )
 =  + 
 ∼  (, )
where  represents the perturbed symbolic knowledge,  represents the original KB,
and  (, ) is a uniform distribution from which the perturbation is sampled.
Input perturbation — We here assess the robustness of the model   itself by
determining whether it is resistant to variations of input. Mathematically, we define the input
perturbation as
where  represents the perturbed input, and  its original counterpart.</p>
        <p>Once the possible perturbations are identified, we can define the SKI robustness measure as:
 =</p>
        <p>1
|( (),  ) −  ( (),  )|
s.t.  =  + 
| | | ≤ 
(2)
(3)
(4)
where  and  represent either the input data or the injected knowledge and its perturbed
counterpart, and  represents the performance of the model. Relevantly,  represents the
selected maximum amount of perturbation and is used to highlight that model’s robustness is
measured using small perturbations. By definition, robust SKI approaches are characterised by
small values for the denominator – absolute diference of performance when a small perturbation
is applied –, thus obtaining high  scores.
3.2.2. Comprehensibility
Neural networks are regarded as black-box since the internal processes that lead to specific
ifnal decisions are mysterious to humans. Due to the widespread use of these methods, even in
relatively-sensitive fields such as medicine and law, the aspect of these models’ explainability is
becoming increasingly important in modern times. This is exemplified by the emergence of
so-called XAI (eXplainable AI) and the GDPR’s recommendations regarding the need to provide
systems that are explicable and understandable to external users.</p>
        <p>The introduction of symbolic knowledge within sub-symbolic models prompts one to consider
acquiring more comprehensible models, mostly because symbolic knowledge is expressed in
more comprehensible forms to the human eye and thinking. Indeed, symbolic knowledge
typically takes the form of logical rules, such as  ∧  ⇒ , knowledge graphs, decision trees,
algebraic equations, and so forth. Compared to the numerous complex internal constructs of
sub-symbolic models, the form of expression adopted by this type of knowledge is significantly
more understandable. Therefore, it is natural to believe that introducing a type of reasoning
that is more easily encoded by the human mind would result in a more understandable system
in general.</p>
        <p>One wonders, how a system’s comprehensibility can be measured. First, from a particular
perspective, understanding something is itself a subjective construct. In other words, what is
comprehensible to one person may be less comprehensible to another, and this is primarily due
to how certain concepts are perceived and, consequently, identified and mentally assembled.
Etymologically, the Latin word for "comprehension" is "cum capere", which literally means "to
take and put together". As a result, it is not easy to establish an actual metric of comprehension.
What comes to mind is that it might be useful to use extraction mechanisms that allow to extract
the internal reasoning processes of black-box systems in a way that is visually or conceptually
understandable to humans, such as decision trees.</p>
        <p>
          Once these extractions are obtained, comparisons can be made by assessing, for instance,
the obtained model’s complexity. Complexity may refer either to the depth of the tree or to
visual characteristics, such as the number of nodes present. In [23], for example, a measure of
syntactic complexity is defined as:
 (, ) := 
 
 + (1 −  ) 2
(5)
where  ∈ [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ] is a tuning factor that adjusts the weight of  and ,  is the number of nodes,
 is the number of branches, and  is a coeficient built by the authors.
        </p>
        <p>We expect the decision tree representing the reasoning processes of the black-box model
to be more complex than that obtained from the black-box model with knowledge injection.
Obviously, we cannot be certain of this, and one way to assess the comprehensibility of the
model is to solicit feedback from external users by asking simple questions about how much
more comprehensible the tree of the black-box model and the model with knowledge injection is.
This approach is also utilised in [24], and introduces the concept of human-in-the-loop, in which
the human acts to correct, refine, monitor, and evaluate the models. In this context, pertaining
to the interpretability and comprehensibility of ML models, human involvement is crucial and
decisive. This is due to the fact that, as stated previously, interpretation and comprehension
of models depend not only on aspects attributable to the model’s construction in technical
terms, but also on a subjective aspect attributable solely to human experience. Incorporating
such feedback and considering it during the development and refinement of models could be
persuasive in this regard.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Eficiency-related QoS</title>
        <p>While being mainly proposed for steering sub-symbolic model towards desirable behaviours,
SKI can, in principle, bear many advantages related to the overall predictor eficiency. Indeed,
injection techniques are intrinsically substituting part of the data-drivenly learnt concepts with
possibly complex a-priori knowledge. Thus, we here build upon the idea of measuring the
eficiency improvements that SKI might provide against traditional sub-symbolic predictors.</p>
        <p>The eficiency term, however, is foggy by itself and needs a more fine-grained definition, as it
requires to identify the target of the measurement. More in detail, throughout this work we
consider measuring characteristics related to computational eficiency of a predictor, due to the
paramount importance that AI sustainability is gaining recently. Indeed, a multitude of works
stress the necessity of identifying resource-friendly AI solutions [25]. Therefore, we focus on
computational complexity, analysing the following interesting features:
Memory footprint  — i.e., the size of the sub-symbolic predictor under examination.
Energy consumption  —i .e., the amount of energy required to build and run the model.
Latency  — i.e., the time required to run a predictor.</p>
        <p>Data eficiency  — i.e., the amount of data required to optimise the sub-symbolic model.
We then identify their eficiency as the efective gain that the injection mechanism obtains over
its uneducated counterpart. Therefore, we define eficiency metrics as the variation between
 ’s  and  ’s .
3.3.1. Memory Footprint
We first consider the ability of SKI mechanisms to produce lightweight sub-symbolic models.
The injected knowledge lifts part of the learning burden from the predictor at hand, aiming at
avoiding complex or unfeasible data-driven notions learning procedure. Indeed, the a-priori
concepts which are injected should not be learnt from the training samples anymore. As a
consequence, the amount of notions that the sub-symbolic models must learn data-drivenly
might reduce significantly. Fewer notions to be learnt are generally linked with the possibility
of shrinking the sub-symbolic model at hand. Here, we consider model shrinking as a simple
reduction on the amount of parameters that characterises the sub-symbolic model. Enabling
model shrinkage, SKI mechanisms are capable of producing memory eficient predictors.
Therefore, we consider to be stronger SKI approaches the mechanisms that can produce smaller
sub-symbolic models, as they maximise the utility of the injected notions.</p>
        <p>The analysis of sub-symbolic models eficiency – especially NN – is growing in popularity
recently, due to the ever-increasing need for sustainable intelligent models. Therefore, there exist
a set of well-established memory footprint measures of sub-symbolic models in current literature.
We consider leveraging such measures to analyse the eficiency gain of SKI approaches, avoiding
cumbersome definition of ad-hoc – possibly faulty – SKI metrics. More in detail, we propose to
measure models footprint by counting the number of parameters composing the underlying
NN model. Alternatively, we can also leverage metrics such as Floating Point OPerations
(FLOPs) or Multiplication Addition Computations (MACs), which measures the amount of total
operations or multiplications and additions required to perform a single inference respectively.
MACs consider solely multiplications and summations as they represent the most common
computations in NNs. These measures are indicative of the amount of memory required either
to fit the whole sub-symbolic model – total number of parameters – or to run it—FLOPs and
MACs. Albeit simple, these metrics are efective for measuring models complexity and overall
computational memory eficiency [26, 27].</p>
        <p>However, measuring FLOPs or MACs by themselves is not suficient to measure the
efectiveness of SKI in increasing memory eficiency. Indeed, we need to properly define the memory
eficiency improvements obtained leveraging SKI against its uneducated counterpart. Therefore,
we define the memory eficiency improvement as the amount of memory gain that injection
attains while achieving at least the same prediction performance of the uneducated sub-symbolic
model it works upon. Mathematically:
 =Ψ
︁(</p>
        <p>︁)</p>
        <p>(, ℐ,  ) − Ψ(  ( ))
where  represents the sub-symbolic model working on task  , and 
counterparts trained with the aid of a-priori knowledge  injected through the injection
mechanism ℐ. Ψ represents the memory eficiency metric chosen for the single model – e.g.,
FLOPs, MACs, etc. –, while (, ) identifies the performance obtained by the model  over
 identifies its SKI</p>
        <p>From Equation (6) it is possible to notice that the proposed memory eficiency gain metric
sufers from the same artefacts</p>
        <p>A1-A3 dependency discussed in Section 3.1. However, the aim
of the proposed metric is to identify eficiency gains of SKI w.r.t. to its uneducated counterpart.
Therefore, the A2 and A3 artefacts dependency assume smaller relevance. Meanwhile,
dependency on knowledge quality – i.e., A1 – can be eliminated by standardising the KB used to
compare diferent SKIs.
3.3.2. Energy Consumption
Recently, research groups scattered around the globe are starting to focus their attention toward
the development of sustainable intelligent systems. Indeed, popular AI solutions commonly
rely on complex and resource hungry sub-symbolic systems such as NNs aiming at attaining
general intelligence—i.e., AI systems capable of solving multiple heterogeneous tasks. However,
the rampaging evolution of NNs resource hungriness is not sustainable both economically and
environmentally.</p>
        <p>Multiple research proposals focus on the analysis of energy consumption of AI solutions
throughout their life cycle [28, 29]. Most of such approaches rely on ad-hoc strategy to compress
or optimise sub-symbolic models, missing the massive opportunity given by SKI approaches.
Indeed, the introduction of injection mechanisms in the data-driven pipeline of sub-symbolic
training mechanisms allows to reduce the amount of computations required to train and run
sub-symbolic predictors. Knowledge injection reduces the complexity of the learning process,
removing the burden of learning the a-priori KB from the training samples available. Thus, it is
reasonable to assume for SKI mechanisms to allow reducing the amount of computations that
characterise a model life-cycle. At least it is reasonable to identify as stronger SKI approaches
the set of frameworks that majorly reduce the energy consumption of a sub-symbolic model.</p>
        <p>The proposed energy consumption metric is tightly related with memory eficiency
(Section 3.3.1). Indeed, it is usually the case for smaller models to require fewer amounts of energy
to train and run. However, there might exist memory eficient models requiring a higher amount
of energy to train and run, such as sparse models. Indeed, sparsity induces a lower amount
of operations, but is not usually efectively implemented at hardware level, increasing power
consumption [26]. Therefore, energy eficiency represents a metric that is worth to be analysed
by itself.</p>
        <p>To analyse energy consumption and the possible improvements that SKI might introduce, we
need to first define the life-cycle of AI models, analysing each component resource hungriness.
In order to build and deploy a data-driven AI solution, there exist several steps to complete,
namely:
1. Model definition . This phase represents the process of analysing the task at hand and
selecting the best suitable sub-symbolic model.
2. Model training. During this phase the sub-symbolic model is trained using the set of
samples extracted from a specific dataset. The amount of training samples may difer
depending on the task and model at hand, impacting the resource requirements. Indeed,
during training, the predictor runs and is updated multiple times to achieve its optimal
setup.
3. Model testing. The obtained optimal model is tested against a – limited – set of testing
samples to check if the performance are satisfactory.
4. Model deployment. Once the model is trained, reaching satisfactory performance, it is
deployed in its real-world application. Here, the model runs multiple times, depending
on the specific application.</p>
        <p>From the definition of the data-driven AI life-cycle, it is possible to highlight that the training
and deployment phases are the most resource hungry. Indeed, training requires a huge amount
of model runs and updates, while the model deployment might be very costly – w.r.t. energy –
depending on predictions frequency and its life expectation. Therefore, we need to define an
application specific trade-of parameter</p>
        <p>balancing the cost of training and deployment.</p>
        <p>We can now define the energy consumption eficiency of a SKI mechanism as the amount of
energy saving of its life-cycle against an uneducated counterpart. Mathematically:
︁(</p>
        <p>
          (, ℐ,  ) − [Υ ( ( )) +  Υ ( ( ))]
where Υ  and Υ  represent the energy spent by the model during training and deployment
respectively.
3.3.3. Latency
The eficiency level of a sub-symbolic model can be intended as the amount of time that it takes to
operate—i.e., compute its prediction. This time is usually called latency and refers to the amount
of time necessary to produce an output from a single sample fed into a trained NN. Latency is a
good indicator of the ability of a model to produce real-time outputs in a real-world application.
Such metric represents a crucial characteristic of an AI model in various time-costly scenarios.
Few examples might come from scenarios where human lives depend on the AI model deployed,
such as intelligent transportation [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] and e-health [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Moreover, latency assumes a relevant role
in multi-agent scenarios, where collaboration between multiple intelligent entities is required,
and there can not exist lag between them due to lengthy computations [30]. Therefore, research
eforts in the field of sub-symbolic models recently focused on identifying time-sensitive models.
        </p>
        <p>Given a SKI mechanism, we now propose to measure its capability of increasing the time
eficiency of the sub-symbolic model upon which it works. Indeed, injection systems may
bring several timing benefits, removing few unnecessary computations. On the other hand, SKI
systems might also introduce delayed computations linked with the analysis of the given KB,
such as grounding issues [31]. Therefore, measuring if and how SKI influence model latency
represents a relevant research aspect for defining SKI QoS. We here define the latency gain
as the diference between the inference time of the SKI model and its uneducated counterpart:
 = ( (, ℐ,  )) −  ( ( ))
where  represents inference time.</p>
        <p>
          Similarly to the energy measurement, the latency metric is tightly related to the complexity of
the obtained sub-symbolic models and therefore with . However, like energy consumption,
latency is not always directly proportional to the amount of operations that construct the
model at hand. Sparsely-structured operations might slow down the inference process due to
their ineficient computation at hardware level. Moreover, input data complexity and quality
might alter the latency achieved by the predictor. Indeed, inference over diferent samples
(7)

(8)
characterised by the same structure, may take vastly diferent timings, as shown in the attack
proposed in [32].
3.3.4. Data Eficiency
Sub-symbolic models rely on data-driven training approaches to optimise their performance over
a given task. While representing the key of their groundbreaking performance, this data-driven
procedure is not a silver bullet solution. Indeed, it requires collecting significant amount of data
samples for each task to be tackled. The data collection process is time costly and depending on
the application might be cumbersome and foggy—e.g., emotion recognition [33]. Given this
costly drawback, recent research eforts have focused on proposing data-frugal models [ 34].
Among them, knowledge injection mechanisms play a significant role [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. Indeed, leveraging
a-priori knowledge, SKI removes part of the learning process burden. Several concepts that an
uneducated model would need to learn from a set of data are injected automatically into the
educated model. Therefore, some portions of the training data are not required for the model
to attain an acceptable performance level. Here, the leveraged efect of SKI is to decouple the
learning process from part of the data, obtaining frugal models.
        </p>
        <p>We here define the data eficiency gain  of a SKI mechanism as the diference between
the data footprint required to train an uneducated sub-symbolic model and its SKI counterpart.
Given a dataset  defined as</p>
        <p>= {({ 1,...,}, {ℎ1,...,ℎ})},  ∈  ,  ∈ , ∀ ∈ [0,  ]
we define the data footprint  as the amount of samples used during training multiplied by the
memory cost of a single sample, which can be roughly computed as:
(9)
(10)
(11)
where  represents the amount of samples in the dataset,  represents the ℎ dimension of a
training sample and  represents the memory used to store the value corresponding to ℎ
dimension of the training sample. Therefore, the data eficiency gain of a SKI mechanism can
be written as:
 =( ( )) −  ( (, ℐ,  ))
s.t. ( ,  ) ≥  ( ,  )
 =  ×

∏︁  × 
=1
The simplest approach to improve data eficiency in SKI mechanisms is to reduce the amount
of samples that compose the training dataset—N in Equation (10). However, it may also be
interesting to consider increasing data eficiency via reduction of the dimensionality of the
dataset, either by reducing  or . Indeed, injecting some a-priori knowledge describing a
subset of the dataset features, might allow to remove the corresponding dimension from the
dataset samples. Moreover, it would also be possible to reduce data complexity by compressing
data representations—i.e., reduce memory representation . However, SKI techniques usually
do not impact  directly, as this is usually hardware defined.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Taxonomy of SKI QoS</title>
      <p>We here propose a taxonomy (Figure 2) that classify the various proposed metrics according
to two relevant research realms such as sustainability and explainability. The latency and
energy consumption metrics are clearly related to model sustainability and in disjunction from
explainability. Indeed, while it is obvious to consider more energy-friendly mechanisms to
be characterised by higher level of sustainability, it is not possible to identify them as more
explainable. On the opposite side of the spectrum we find the robustness and comprehensibility
metrics, which are clearly related to the XAI realm, while being disconnected from suistainability.
Indeed, there exist no proofs that an explainable model tends to be more suistainable, but rather
the opposite, as the explanation mechanism might be very complex a energy hunger. A more
interesting analysis can be done concerning the memory footprint and data eficiency metrics,
for which we believe there exist strong connections to both the model’s sustainability and
explainability. The relationship between the memory footprint metric and model sustainability
is immediate: what we measure is the number of parameters that comprise a model and therefore
its computational complexity and power hungriness. More complex models are less sustainable,
and less complex models are more sustainable. In general, we anticipate that models with
knowledge injection will lead to a restriction of the sub-symbolic model with a noticeable
reduction in parameters, resulting in increased sustainability. Also with regard to the model’s
explainability relationship, it can be argued that a simpler models with fewer parameters are
more interpretable [35]. Integration of symbolic and sub-symbolic systems is thought to improve
the explainability of black-box models in part because the sub-symbolic model is simplified and
requires fewer parameters. Focusing on data eficiency, in terms of sustainability we can state
that utilising a smaller amount of data to train a model as opposed to large amounts of data is
considered a sustainable solution—i.e., less data equals greater sustainability and viceversa. In
terms of explainability, the process of learning models trained with fewer data is simpler and
less ambiguous. Again, it is believed that knowledge injection improves the sustainability and
explainability of models by requiring less training data. As described in Section 3.3.4, the large
amount of data required by the models is compensated for by the knowledge injected into them.</p>
      <p>Latency</p>
      <p>Energy</p>
      <p>Consumption</p>
      <p>SUSTAINABILITY</p>
    </sec>
    <sec id="sec-5">
      <title>5. SKI QoS Impacts on Agents</title>
      <p>In this section we briefly discuss the possible impact of SKI and its related QoS metrics on the
ifeld of agents and Multi-Agents Systems (MAS). Here, it is surely relevant to highlight the
impact of sub-symbolic – especially ML and DL – systems eficiency in the agents life-cycle.
Indeed, popular works and products propose to leverage intelligent agents to solve complex
tasks such as identification and understanding of the surrounding environment. Such intelligent
agents rely on heavily integrated sub-symbolic mechanisms which might be even learnt on the
lfight. Thus, advanced agents must be capable of training and running sub-symbolic mechanisms
which might be arbitrarily complex, depending on the task at hand. As a consequence, the
possible ineficiency of sub-symbolic models integrated into agents impacts their functioning in
several ways, namely:
• Energy and computational ineficiency of sub-symbolic models afects the overall
independence of agents, limiting their life-span [29]. Indeed, agent systems usually rely on limited
amount of energy to enable agents freedom and thus require energy-eficient solutions.
Therefore, measuring the improvements under energy consumption obtained via SKI
mechanisms positively afects agents systems, enabling the identification of deployable
solutions.
• Data ineficiency of sub-symbolic models hinders the ability of agents to learn on the
lfight [ 36]. Indeed, depending on the considered scenario, agents might gather only small
amount of viable data from the surrounding environment. Thus, it is relevant to measure
the data eficiency gains obtained through SKI, as it alleviates part of the data collection
burden from intelligent agents.
• Computational ineficiency of sub-symbolic models hinders the deployability of intelligent
agents solutions in heavily constrained environments [37]. Indeed, there exist several
scenarios requiring agents to be as rawboned as possible—e.g., emergency systems. In
this context, heavy and computationally ineficient sub-symbolic mechanisms could not
be embedded into agents.</p>
      <p>QoS aspects of sub-symbolic models come into play heavily when considering MAS as well.
Indeed, such systems present the eficiency issues related with the deployment of intelligence
into agents, as well as requiring hefty coordination aspects. The coordination requirements
characteristics of MAS introduce the need for eficient interaction between the entities of the
systems. Here, interaction eficiency is tightly linked with the latency of the internal intelligence
engine – i.e., sub-symbolic model – of communicating agents. Indeed, interacting agents can
not be delayed by lengthy predictions of sub-symbolic models. Moreover, the agents interaction
might require exchanging information concerning internal sub-symbolic systems to enable
common intelligence or community reasoning. Therefore, there exist the need for the underlying
sub-symbolic systems to be comprehensible between agents. The comprehensibility aspect
is fundamental, especially when dealing with heterogeneous agents which incorporate their
own model and knowledge base and tackle diferent highly-specific tasks. Therefore, it is
surely relevant to analyse possible improvements or degradation in comprehensibility aspects
of multiple sub-symbolic models, in order to allow MAS to converge towards global intelligence.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions &amp; Future Work</title>
      <p>In this work we propose and mathematically model the first set of Quality-of-Service (QoS)
metrics for SKI mechanisms, aiming at overcoming the open issues that afect SKI strength
evaluation. We define robustness and comprehensibility metrics to analyse efectively the eficacy of
the injection mechanism by itself, decoupling it from possible artefacts that characterise SKI . We
then focus on the eficiency gains achievable through SKI and identify four qualitative metrics,
namely: (i) memory footprint eficiency – i.e., gain in terms of model’s complexity; (ii) energy
eficiency – i.e., gain in terms of total energy required to train and deploy a sub-symbolic model;
(iii) latency eficiency – i.e., improvements in terms of time required for inference; and (iv) data
eficiency – i.e., improvement in terms of amount of data required to optimise a sub-symbolic
model. We also propose to categorise the QoS metrics into a taxonomy that highlights the
diferent realms that may benefit from measurements of the the proposed metrics.</p>
      <p>The QoS metrics proposed in this work are modelled theoretically, and we aim at testing
their eficacy in the future. In particular, we aim at benchmarking a set of state-of-the-art SKI
mechanisms through our QoS metrics. This would allow to identify the efective benefits that
injection mechanisms bring to the realm of symbolic and sub-symbolic integration. Finally, in
the future, we would like to develop a tool capable of automatically benchmarking a given SKI
mechanism leveraging our QoS. To do so, we aim at developing a SKI-QoS library, which will
allow the research community to thoroughly test novel injection mechanisms.
[17] Q. Wang, B. Wang, L. Guo, Knowledge base completion using embeddings and rules, in:
Q. Yang, M. J. Wooldridge (Eds.), Proceedings of the 24th International Joint Conference
on Artificial Intelligence (IJCAI), Buenos Aires, Argentina, July 25-31, 2015, AAAI Press,
2015, pp. 1859–1866. URL: http://ijcai.org/Abstract/15/264.
[18] Q. Liu, H. Jiang, Z. Ling, S. Wei, Y. Hu, Probabilistic reasoning via deep learning: Neural
association models, CoRR abs/1603.07704 (2016). arXiv:1603.07704.
[19] T. Ahmad, D. Zhang, C. Huang, H. Zhang, N. Dai, Y. Song, H. Chen, Artificial intelligence in
sustainable energy industry: Status quo, challenges and opportunities, Journal of Cleaner
Production 289 (2021) 125834. doi:10.1016/j.jclepro.2021.125834.
[20] D. Alvarez-Melis, T. S. Jaakkola, On the robustness of interpretability methods, CoRR
abs/1806.08049 (2018). arXiv:1806.08049.
[21] S. Verma, J. P. Dickerson, K. Hines, Counterfactual explanations for machine learning: A
review, CoRR abs/2010.10596 (2020). arXiv:2010.10596.
[22] F. Bodria, F. Giannotti, R. Guidotti, F. Naretto, D. Pedreschi, S. Rinzivillo, Benchmarking
and Survey of Explanation Methods for Black Box Models, CoRR abs/2102.13076 (2021).
arXiv:2102.13076.
[23] R. Confalonieri, T. Weyde, T. R. Besold, F. M. d. P. Martín, Using ontologies to enhance
human understandability of global post-hoc explanations of black-box models, Artificial
Intelligence 296 (2021) 103471. doi:10.1016/j.artint.2021.103471.
[24] R. Piltaver, M. Luštrek, M. Gams, S. Martinčić-Ipšić, What makes classification trees
comprehensible?, Expert Systems with Applications 62 (2016) 333–346. doi:10.1016/j.
eswa.2016.06.009.
[25] A. Canziani, E. Culurciello, A. Paszke, Evaluation of neural network architectures for
embedded systems, in: IEEE International Symposium on Circuits and Systems, ISCAS
2017, IEEE, Baltimore, MD, USA, 2017, pp. 1–4. doi:10.1109/ISCAS.2017.8050276.
[26] G. Huang, S. Liu, L. van der Maaten, K. Q. Weinberger, CondenseNet: An eficient DenseNet
using learned group convolutions, in: 2018 IEEE Conference on Computer Vision and
Pattern Recognition, CVPR 2018, Salt Lake City, UT, USA, June 18-22, 2018, Computer
Vision Foundation / IEEE Computer Society, 2018, pp. 2752–2761. doi:10.1109/CVPR.
2018.00291.
[27] H. Cheng, T. Zhang, Y. Yang, F. Yan, H. Teague, Y. Chen, H. Li, MSNet: Structural
wired neural architecture search for internet of things, in: 2019 IEEE/CVF International
Conference on Computer Vision Workshops, ICCV Workshops 2019, Seoul, Korea (South),
October 27-28, 2019, IEEE, 2019, pp. 2033–2036. doi:10.1109/ICCVW.2019.00254.
[28] Y. Wang, B. Li, R. Luo, Y. Chen, N. Xu, H. Yang, Energy eficient neural networks for big
data analytics, in: G. P. Fettweis, W. Nebel (Eds.), Design, Automation &amp; Test in Europe
Conference &amp; Exhibition, DATE 2014, Dresden, Germany, March 24-28, 2014, European
Design and Automation Association, 2014, pp. 1–2. doi:10.7873/DATE.2014.358.
[29] E. H. Lee, D. Miyashita, E. Chai, B. Murmann, S. S. Wong, LogNet: Energy-eficient neural
networks using logarithmic computation, in: 2017 IEEE International Conference on
Acoustics, Speech and Signal Processing, ICASSP 2017, IEEE, New Orleans, LA, USA, 2017,
pp. 5900–5904. doi:10.1109/ICASSP.2017.7953288.
[30] W. Hou, M. Fu, H. Zhang, Z. Wu, Consensus conditions for general second-order
multiagent systems with communication delay, Automatica 75 (2017) 293–298. doi:10.1016/j.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D. W.</given-names>
            <surname>Otter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Medina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. K.</given-names>
            <surname>Kalita</surname>
          </string-name>
          ,
          <article-title>A survey of the usages of deep learning for natural language processing</article-title>
          ,
          <source>IEEE Transactions on Neural Networks and Learning Systems</source>
          <volume>32</volume>
          (
          <year>2021</year>
          )
          <fpage>604</fpage>
          -
          <lpage>624</lpage>
          . doi:
          <volume>10</volume>
          .1109/TNNLS.
          <year>2020</year>
          .
          <volume>2979670</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A. B.</given-names>
            <surname>Nassif</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Shahin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. B.</given-names>
            <surname>Attili</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Azzeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shaalan</surname>
          </string-name>
          ,
          <article-title>Speech recognition using deep neural networks: A systematic review</article-title>
          ,
          <source>IEEE Access 7</source>
          (
          <year>2019</year>
          )
          <fpage>19143</fpage>
          -
          <lpage>19165</lpage>
          . doi:
          <volume>10</volume>
          .1109/ ACCESS.
          <year>2019</year>
          .
          <volume>2896880</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Z.-Q.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zheng</surname>
          </string-name>
          , S.-t. Xu,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <article-title>Object detection with deep learning: A review</article-title>
          ,
          <source>IEEE Transactions on Neural Networks and Learning Systems</source>
          <volume>30</volume>
          (
          <year>2019</year>
          )
          <fpage>3212</fpage>
          -
          <lpage>3232</lpage>
          . doi:
          <volume>10</volume>
          . 1109/TNNLS.
          <year>2018</year>
          .
          <volume>2876865</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Esteva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yeung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Naik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Madani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mottaghi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Topol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Socher</surname>
          </string-name>
          ,
          <article-title>Deep learning-enabled medical computer vision</article-title>
          ,
          <source>NPJ Digital Medicine</source>
          <volume>4</volume>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          . URL: https://www.nature.com/articles/s41746-020-00376-2.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Grigorescu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Trasnea</surname>
          </string-name>
          , T. T. Cocias,
          <string-name>
            <given-names>G.</given-names>
            <surname>Macesanu</surname>
          </string-name>
          ,
          <article-title>A survey of deep learning techniques for autonomous driving</article-title>
          ,
          <source>Journal of Field Robotics</source>
          <volume>37</volume>
          (
          <year>2020</year>
          )
          <fpage>362</fpage>
          -
          <lpage>386</lpage>
          . doi:
          <volume>10</volume>
          . 1002/rob.21918.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M. V. M.</given-names>
            <surname>França</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Zaverucha</surname>
          </string-name>
          , A. S. d. Garcez,
          <article-title>Fast relational learning using bottom clause propositionalization with artificial neural networks</article-title>
          ,
          <source>Machine Learning</source>
          <volume>94</volume>
          (
          <year>2014</year>
          )
          <fpage>81</fpage>
          -
          <lpage>104</lpage>
          . doi:
          <volume>10</volume>
          .1007/s10994-013-5392-1.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A. S.</given-names>
            <surname>d'Avila Garcez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gori</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. C.</given-names>
            <surname>Lamb</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Serafini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Spranger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. N.</given-names>
            <surname>Tran</surname>
          </string-name>
          ,
          <article-title>Neuralsymbolic computing: An efective methodology for principled integration of machine learning and reasoning</article-title>
          ,
          <source>Journal of Applied Logics</source>
          <volume>6</volume>
          (
          <year>2019</year>
          )
          <fpage>611</fpage>
          -
          <lpage>632</lpage>
          . URL: https:// collegepublications.co.uk/ifcolog/?00033.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Agiollo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Ciatto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          ,
          <article-title>Graph neural networks as the copula mundi between logic and machine learning: A roadmap</article-title>
          , in: R. Calegari,
          <string-name>
            <given-names>G.</given-names>
            <surname>Ciatto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Denti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          , G. Sartor (Eds.),
          <source>WOA 2021 - 22nd Workshop “</source>
          From Objects to Agents”, volume
          <volume>2963</volume>
          <source>of CEUR Workshop Proceedings</source>
          , Sun SITE Central Europe, RWTH Aachen University,
          <year>2021</year>
          , pp.
          <fpage>98</fpage>
          -
          <lpage>115</lpage>
          . URL: http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2963</volume>
          /paper18.pdf, 22nd Workshop “From Objects to Agents
          <source>” (WOA</source>
          <year>2021</year>
          ), Bologna, Italy, 1
          <article-title>-3 September 2021</article-title>
          . Proceedings.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Diligenti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Roychowdhury</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gori</surname>
          </string-name>
          ,
          <article-title>Integrating prior knowledge into deep learning</article-title>
          , in: X.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Luo</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Luo</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Palade</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <string-name>
            <surname>Wani</surname>
          </string-name>
          (Eds.),
          <source>16th IEEE International Conference on Machine Learning and Applications, ICMLA</source>
          <year>2017</year>
          , Cancun, Mexico,
          <source>December 18-21</source>
          ,
          <year>2017</year>
          , IEEE,
          <year>2017</year>
          , pp.
          <fpage>920</fpage>
          -
          <lpage>923</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICMLA.
          <year>2017</year>
          .
          <volume>00</volume>
          -
          <fpage>37</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , T. Friedman,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Van den Broeck, A semantic loss function for deep learning with symbolic knowledge</article-title>
          , in: J. G. Dy,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Krause (Eds.),
          <source>Proceedings of the 35th International Conference on Machine Learning (ICML)</source>
          , Stockholmsmässan, Stockholm, Sweden,
          <source>July 10-15</source>
          ,
          <year>2018</year>
          , volume
          <volume>80</volume>
          <source>of Proceedings of Machine Learning Research, PMLR</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>5498</fpage>
          -
          <lpage>5507</lpage>
          . URL: http://proceedings.mlr.press/v80/xu18h.html.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>G.</given-names>
            <surname>Marra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Giannini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Diligenti</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Gori, LYRICS: A general interface layer to integrate logic inference and deep learning</article-title>
          , in: U. Brefeld, É. Fromont,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hotho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Knobbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. H.</given-names>
            <surname>Maathuis</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          Robardet (Eds.),
          <source>Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD</source>
          <year>2019</year>
          , Würzburg, Germany,
          <source>September 16-20</source>
          ,
          <year>2019</year>
          , Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>II</given-names>
          </string-name>
          , volume
          <volume>11907</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2019</year>
          , pp.
          <fpage>283</fpage>
          -
          <lpage>298</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -46147-8_
          <fpage>17</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>V.</given-names>
            <surname>Tresp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hollatz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ahmad</surname>
          </string-name>
          ,
          <article-title>Network structuring and training using rule-based knowledge</article-title>
          , in: S. J.
          <string-name>
            <surname>Hanson</surname>
            ,
            <given-names>J. D.</given-names>
          </string-name>
          <string-name>
            <surname>Cowan</surname>
            ,
            <given-names>C. L.</given-names>
          </string-name>
          Giles (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          <volume>5</volume>
          , Morgan Kaufmann,
          <year>1992</year>
          , pp.
          <fpage>871</fpage>
          -
          <lpage>878</lpage>
          . URL: http://papers.nips.cc/ paper/638-network
          <article-title>-structuring-and-training-using-rule-based-knowledge</article-title>
          , NIPS Conference, Denver, Colorado, USA, November 30-December 3,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A. S. d.</given-names>
            <surname>Garcez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Gabbay</surname>
          </string-name>
          ,
          <article-title>Fibring neural networks</article-title>
          , in: D. L.
          <string-name>
            <surname>McGuinness</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          Ferguson (Eds.),
          <source>Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, July 25-29</source>
          ,
          <year>2004</year>
          , San Jose, California, USA, AAAI Press / The MIT Press,
          <year>2004</year>
          , pp.
          <fpage>342</fpage>
          -
          <lpage>347</lpage>
          . URL: http://www.aaai.org/Library/AAAI/
          <year>2004</year>
          /aaai04-
          <fpage>055</fpage>
          .php.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>R.</given-names>
            <surname>Evans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Grefenstette</surname>
          </string-name>
          ,
          <article-title>Learning explanatory rules from noisy data</article-title>
          ,
          <source>Jounal of Artificial Intelligence Research</source>
          <volume>61</volume>
          (
          <year>2018</year>
          )
          <fpage>1</fpage>
          -
          <lpage>64</lpage>
          . doi:
          <volume>10</volume>
          .1613/jair.5714.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>R.</given-names>
            <surname>Manhaeve</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dumancic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kimmig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Demeester</surname>
          </string-name>
          , L. De Raedt,
          <article-title>Neural probabilistic logic programming in DeepProbLog</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>298</volume>
          (
          <year>2021</year>
          )
          <article-title>103504</article-title>
          . doi:
          <volume>10</volume>
          . 1016/j.artint.
          <year>2021</year>
          .
          <volume>103504</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bordes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Usunier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>García-Durán</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Weston</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Yakhnenko</surname>
          </string-name>
          ,
          <article-title>Translating embeddings for modeling multi-relational data</article-title>
          , in: C.
          <string-name>
            <surname>J. C. Burges</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Bottou</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Ghahramani</surname>
            ,
            <given-names>K. Q.</given-names>
          </string-name>
          <string-name>
            <surname>Weinberger</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of 27th Annual Conference on Neural Information Processing Systems (NeurIPS)</source>
          , Lake Tahoe, Nevada,
          <source>United States, December 5-8</source>
          ,
          <year>2013</year>
          ,
          <year>2013</year>
          , pp.
          <fpage>2787</fpage>
          -
          <lpage>2795</lpage>
          . URL: https://proceedings.neurips.cc/paper/2013/hash/ 1cecc7a77928ca8133fa24680a88d2f9-Abstract.html.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>