<!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>Logics in Machine Learning and Data Mining: Achievements and Open Issues</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Francesca A. Lisi</string-name>
          <email>FrancescaAlessandra.Lisi@uniba.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dipartimento di Informatica &amp; Centro Interdipartimentale di Logica e Applicazioni (CILA) Universita degli Studi di Bari \Aldo Moro"</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This short paper overviews 20 years of work done in logicbased Machine Learning and Data Mining along three di erent directions of research. The aim is to discuss the achievements and the open issues with reference to some challenging applications which involve representation and reasoning.</p>
      </abstract>
      <kwd-group>
        <kwd>Inductive Logic Programming scription Logics</kwd>
        <kwd>Fuzzy Logic</kwd>
        <kwd>Metamodeling</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        The current hype about AI is mainly due to a number of successful applications
of Machine Learning (ML) and Data Mining (DM) algorithms in challenging
domains such as vision. Most of these algorithms belong to the new generation
of neural networks known under the name of \deep learning". Deep learning
follows a function-based approach, i.e., it formulates ML tasks as function- tting
problems. Neural networks are therefore considered as examples of model-free AI
according to the de nition given by Hector Ge ner in his keynote talk at IJCAI
2018 [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. While analyzing the limitations of this approach, several works (see,
e.g., [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]) have placed the emphasis on the need to construct and use models, as
required by model-based AI, for the sake of interpretability and explainability.
The model-based approach - a distinguishing feature of what is currently referred
to as \good old-fashioned AI" - requires one to represent knowledge about
entities of a domain of interest and involves reasoning with such knowledge. Logics
and probability are among the main tools of this approach today.
      </p>
      <p>
        As a drawback of the popularity of deep learning, the emerging trend is to
have ML streamlined into neural network research. Yet, the variety of ML and
DM algorithms is wide enough to have a signi cant overlap with model-based AI.
Inductive Logic Programming (ILP) [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ] is considered as the major logic-based
(thus, model-based) approach to learning and mining rules from structured data.
Originally focused on the induction of logic programs, due to the common roots
with Logic Programming (LP) [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ], ILP has signi cantly widened its scope over
the years to cover all aspects of learning and mining in logic [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ]. Notable is
the exploration of the intersections to statistical learning and other probabilistic
approaches (see, e.g., [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ] for a survey).
      </p>
      <p>In the following section I will overview the work done in ILP over the past
20 years along three di erent directions of research. The aim is to discuss the
achievements and the open issues with reference to some challenging applications
which involve representation and reasoning. In Section 3 I will conclude the paper
with nal remarks.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Three Cases for Logics in ML and DM</title>
      <sec id="sec-2-1">
        <title>Combining rules and ontologies</title>
        <p>
          Rules are widely used in Knowledge Engineering (KE) as a powerful way of
modeling knowledge. However, the acquisition of rules for very large Knowledge
Bases (KBs) still remains a very demanding KE activity. A partial automation of
the rule authoring task can be of help even though the automatically produced
rules are not guaranteed to be correct. A viable solution to this KE bottleneck is
just applying ILP algorithms. ILP has been historically concerned with learning
rules from examples and background knowledge with the aim of prediction (see,
e.g., the system Foil [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ]). However, ILP has also been applied to tasks - such as
association rule mining - other than classi cation where the scope of induction
is description rathen than prediction. A notable example of this kind of ILP
systems is Warmr [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] which mines frequent Datalog queries.
        </p>
        <p>
          With the advent of the Semantic Web new challenges and opportunities have
been presented to ILP. In particular, ontologies and their logical foundations in
the family of Description Logics (DLs) [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] raised several issues for the direct
application of existing ILP systems, thus urging the extension and/or
adaptation of the ILP methodological apparatus to the novel context. The reason for
this is the following: LP and DLs are both based on fragments of First Order
Logic (FOL), yet characterized by di erent semantic assumptions [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ]. Though
a partial overlap exists between LP and DLs, even more interesting is a
combination of the two via several integration schemes that are aimed at designing
very expressive FOL languages and ultimately overcoming the aforementioned
semantic mismatch (see, e.g., [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] for a survey). A representative example of this
class of hybrid KR formalisms is AL-log [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] which tightly integrates Datalog
and the DL ALC.
        </p>
        <p>
          Starting from the seminal work by Rouveirol and Ventos [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ], several
proposals in ILP testify the great potential of these formalisms also from the ML&amp;DM
perspective [
          <xref ref-type="bibr" rid="ref15 ref19 ref20 ref21 ref23 ref25">15,25,19,20,21,23</xref>
          ]. Originally motivated by a spatial data mining
application [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] and inspired by Warmr, AL-QuIn [
          <xref ref-type="bibr" rid="ref21 ref25">25,21</xref>
          ] is an ILP system for
mining association rules at multiple levels of granularity within the KR
framework of AL-log. Here, reasoning in AL-log allows for the actual exploitation
of taxonomies possibly made available as background knowledge, such as the
classi cation of spatial objects in geographic information systems (see [
          <xref ref-type="bibr" rid="ref1 ref25">1,25</xref>
          ] for
examples of application in this context).
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Dealing with imprecision and granularity</title>
        <p>
          Imprecision is a weak form of vagueness, not to be mistaken for uncertainty,
which is often formalized with fuzzy set theory. For instance, spatial notions
such as the distance between two sites can be naturally represented with fuzzy
sets (modeling the degrees of distance, e.g., high, medium and low) if one is
interested in their human perception rather than in precise measurements. In
order to deal with imprecision in Ontology Reasoning several fuzzy extensions
of DLs have been proposed (see, e.g., [
          <xref ref-type="bibr" rid="ref40">40</xref>
          ] for an overview).
        </p>
        <p>
          The problem of automatically managing the evolution of fuzzy DL
ontologies has attracted some interest in the ILP community [
          <xref ref-type="bibr" rid="ref14 ref16 ref27 ref28">16,14,27,28</xref>
          ]. Iglesias
and Lehmann [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] extend DL-Learner [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] (the state-of-the-art ILP system for
learning in DLs) with some of the most up-to-date fuzzy ontology tools.
Notably, the resulting system can learn fuzzy OWL DL equivalence axioms from
FuzzyOWL 2 1 ontologies by interfacing the fuzzyDL 2 reasoner. Lisi and
Straccia [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] propose SoftFoil, a FOIL-like method for learning fuzzy E L GCI axioms
from fuzzy DL assertions. In [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ], the same authors present Foil-DL, another
FOIL-like method which, conversely, is designed for learning fuzzy E L(D) GCI
axioms from crisp DL assertions. As opposite to SoftFoil, Foil-DL has been
implemented and tested [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ], notably in a real-world tourism application where
fuzzy DLs come into play for modeling imprecise knowledge such as the hotel
price ranges.
        </p>
        <p>
          Imprecision dealt with fuzzy sets is strongly related to the notion of
information granule. In [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ], Lisi and Mencar propose a granular computing method
for OWL 2 ontologies with the ultimate goal of optimizing the learning
process when dealing with a huge number of relations, e.g., those concerning the
distance between places in the abovementioned tourism application. Here,
information granulation encompasses the use of fuzzy quanti ers such as \most" and
\a few" in OWL 2 ontologies as detailed in [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ]. Soft quanti cation has been
also explored in statistical relational learning [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
2.3
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Modeling and metamodeling</title>
        <p>
          Research in ML and DM has traditionally focussed on designing e ective
algorithms for solving particular tasks, most of which can be seen as Constraint
Satisfaction Problems (CSPs) or Optimization Problems (OPs). However, there
is an increasing interest in providing the user with a means for specifying what
the ML/DM problem in hand actually is, rather than letting him struggle to
outline how the solution to that problem needs to be computed (see the recent note
by De Raedt [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]). This corresponds to a model+solver approach to ML and DM,
in which the user speci es the problem in a declarative modeling language and
the system automatically transforms such models into a format that can be used
by a solver to e ciently generate a solution. For instance, constraint
programming has been successfully applied to itemset mining problems (see, e.g., [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]
        </p>
        <sec id="sec-2-3-1">
          <title>1 http://www.straccia.info/software/FuzzyOWL/ 2 http://www.straccia.info/software/fuzzyDL/intro.html</title>
          <p>
            for a comprehensive account). The model+solver approach is also at the basis of
Meta-Interpretive Learning (MIL) [
            <xref ref-type="bibr" rid="ref36">36</xref>
            ], a novel and promising ILP framework.
MIL uses descriptions in the form of meta-rules (expressed in a higher-order
dyadic Datalog fragment) with procedural constraints incorporated within a
meta-interpreter, which could be eventually implemented by relying on Answer
Set Programming (ASP) solvers (see [
            <xref ref-type="bibr" rid="ref11">11</xref>
            ] for an updated overview).
          </p>
          <p>
            The importance of metamodeling in several applications has been recently
recognized in the KR community, with an increasing interest in higher-order
DLs. In particular, De Giacomo et al. [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ] augment a DL with variables that may
be interpreted - in a Henkin semantics - as individuals, concepts, and roles at the
same time, obtaining a new logic Hi(DL). Colucci et al. [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] introduce
secondorder features in DLs under Henkin semantics for modeling several forms of
nonstandard reasoning. Lisi [
            <xref ref-type="bibr" rid="ref22">22</xref>
            ] extends [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] to some variants of Concept Learning,
thus being the rst to propose higher-order DLs as a means for metamodeling in
ML and DM. In [
            <xref ref-type="bibr" rid="ref29">29</xref>
            ], the proposed model+solver approach combines the e cacy
of higher-order DLs in metamodeling (as shown in [
            <xref ref-type="bibr" rid="ref22">22</xref>
            ]) with the e ciency of
ASP solvers in dealing with CSPs and OPs. More recently, higher-order DLs
have been considered as a starting point for the de nition of a metaquerying
language for mining the Web of Data [
            <xref ref-type="bibr" rid="ref24">24</xref>
            ].
3
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Final remarks</title>
      <p>Initiatives such as the workshop series promoted by the Association for
NeuroSymbolic Integration (NeSy)3 since 2005 testify the need to address a
fundamental open issue in AI: How to come up with a computational model capable
of learning and reasoning both at the symbolic and the sub-symbolic level?</p>
      <p>One such issue is also addressed by the Angry Birds AI4 competition, built
around what is currently considered a challenging problem for AI: to build an
intelligent agent that can play new levels of the Angry Birds game better than
the best human players. This is a very di cult problem as it requires agents
to predict the outcome of physical actions without having complete knowledge
of the world, and then to select a good action out of in nitely many possible
actions. A distinguishing feature of future AI systems is just this capability of
interacting with the physical world. The Angry Birds AI competition provides a
simpli ed and controlled environment for developing and testing this capability.</p>
      <p>The ILP works overviewed in this short paper testify an e ort towards the
integration between learning and reasoning, mostly at the symbolic level.
However, the use of fuzzy logic could be considered as an attempt at dealing with
the sub-symbolic level. Also, as opposed to neural networks, fuzzy systems have
the potential of being interpretable and explainable.</p>
      <p>A notorious drawback for ILP is the cost of computation. One of the
advantages of the model+solver approach should be just to choose the most e cient
solver to improve the performance of the learning process while preserving the</p>
      <sec id="sec-3-1">
        <title>3 http://www.neural-symbolic.org/ 4 https://aibirds.org/</title>
        <p>
          declarativity of the model. In this respect, Ge ner's vision [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] of true AI based
on the integration between model-free learners and model-based solvers is a great
source of inspiration.
        </p>
        <p>Acknowledgments This work was partially funded by the INdAM - GNCS Project
2019 \Metodi per il trattamento di incertezza ed imprecisione nella rappresentazione e
revisione di conoscenza", and by the Universita degli Studi di Bari \Aldo Moro" under
the IDEA Giovani Ricercatori 2011 grant \Dealing with Vague Knowledge in Ontology
Re nement".</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Appice</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ceci</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lanza</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malerba</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Discovery of spatial association rules in geo-referenced census data: A relational mining approach</article-title>
          .
          <source>Intelligent Data Analysis</source>
          <volume>7</volume>
          (
          <issue>6</issue>
          ),
          <volume>541</volume>
          {
          <fpage>566</fpage>
          (
          <year>2003</year>
          ), http://content.iospress.com/articles/ intelligent
          <article-title>-data-analysis/ida00146</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Baader</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McGuinness</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nardi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patel-Schneider</surname>
            ,
            <given-names>P</given-names>
          </string-name>
          . (eds.):
          <article-title>The Description Logic Handbook: Theory, Implementation and Applications (2nd ed</article-title>
          .). Cambridge University Press (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Colucci</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Di Noia,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Di Sciascio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Donini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.M.</given-names>
            ,
            <surname>Ragone</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>A uni ed framework for non-standard reasoning services in description logics</article-title>
          . In: Coelho,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Studer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Wooldridge</surname>
          </string-name>
          , M. (eds.)
          <source>ECAI 2010 - 19th European Conference on Arti cial Intelligence</source>
          , Lisbon, Portugal,
          <source>August 16-20</source>
          ,
          <year>2010</year>
          , Proceedings.
          <source>Frontiers in Arti cial Intelligence and Applications</source>
          , vol.
          <volume>215</volume>
          , pp.
          <volume>479</volume>
          {
          <fpage>484</fpage>
          . IOS Press (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Darwiche</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Human-level intelligence or animal-like abilities? Commun</article-title>
          . ACM
          <volume>61</volume>
          (
          <issue>10</issue>
          ),
          <volume>56</volume>
          {
          <fpage>67</fpage>
          (
          <year>2018</year>
          ). https://doi.org/10.1145/3271625
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. De Giacomo,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Lenzerini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Rosati</surname>
          </string-name>
          , R.:
          <article-title>Higher-order description logics for domain metamodeling</article-title>
          . In: Burgard,
          <string-name>
            <given-names>W.</given-names>
            ,
            <surname>Roth</surname>
          </string-name>
          ,
          <string-name>
            <surname>D</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the TwentyFifth AAAI Conference on Arti cial Intelligence</source>
          ,
          <source>AAAI</source>
          <year>2011</year>
          , San Francisco, California, USA,
          <year>August</year>
          7-
          <issue>11</issue>
          ,
          <year>2011</year>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>De Raedt</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Languages for learning and mining</article-title>
          .
          <source>In: Proceedings of the TwentyNinth AAAI Conference on Arti cial Intelligence, January 25-30</source>
          ,
          <year>2015</year>
          , Austin, Texas, USA. pp.
          <volume>4107</volume>
          {
          <issue>4111</issue>
          (
          <year>2015</year>
          ), http://www.aaai.org/ocs/index.php/AAAI/ AAAI15/paper/view/9934
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Dehaspe</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toivonen</surname>
          </string-name>
          , H.:
          <article-title>Discovery of frequent Datalog patterns</article-title>
          .
          <source>Data Mining and Knowledge Discovery</source>
          <volume>3</volume>
          ,
          <issue>7</issue>
          {
          <fpage>36</fpage>
          (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Donini</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lenzerini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nardi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schaerf</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>AL-log: Integrating Datalog and Description Logics</article-title>
          .
          <source>Journal of Intelligent Information Systems</source>
          <volume>10</volume>
          (
          <issue>3</issue>
          ),
          <volume>227</volume>
          {
          <fpage>252</fpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Drabent</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eiter</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ianni</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krennwallner</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lukasiewicz</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maluszynski</surname>
          </string-name>
          , J.:
          <article-title>Hybrid Reasoning with Rules and Ontologies</article-title>
          . In: Bry,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Maluszynski</surname>
          </string-name>
          ,
          <string-name>
            <surname>J</surname>
          </string-name>
          . (eds.)
          <article-title>Semantic Techniques for the Web</article-title>
          ,
          <source>The REWERSE Perspective, Lecture Notes in Computer Science</source>
          , vol.
          <volume>5500</volume>
          , pp.
          <volume>1</volume>
          {
          <fpage>49</fpage>
          . Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Farnadi</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bach</surname>
            ,
            <given-names>S.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moens</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Getoor</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cock</surname>
          </string-name>
          , M.D.:
          <article-title>Soft quanti - cation in statistical relational learning</article-title>
          .
          <source>Machine Learning</source>
          <volume>106</volume>
          (
          <issue>12</issue>
          ),
          <year>1971</year>
          {
          <year>1991</year>
          (
          <year>2017</year>
          ). https://doi.org/10.1007/s10994-017-5647-3, https://doi.org/10.1007/ s10994-017-5647-3
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Gebser</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leone</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maratea</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perri</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ricca</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schaub</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Evaluation techniques and systems for answer set programming: a survey</article-title>
          .
          <source>In: Lang [17]</source>
          , pp.
          <volume>5450</volume>
          {
          <fpage>5456</fpage>
          . https://doi.org/10.24963/ijcai.
          <year>2018</year>
          /769
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. Ge ner, H.:
          <article-title>Model-free, model-based, and general intelligence</article-title>
          .
          <source>In: Lang [17]</source>
          , pp.
          <volume>10</volume>
          {
          <fpage>17</fpage>
          . https://doi.org/10.24963/ijcai.
          <year>2018</year>
          /2
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Guns</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nijssen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Raedt</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Itemset mining: A constraint programming perspective</article-title>
          .
          <source>Arti cial Intelligence</source>
          <volume>175</volume>
          (
          <fpage>12</fpage>
          -
          <lpage>13</lpage>
          ),
          <year>1951</year>
          {
          <year>1983</year>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Iglesias</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmann</surname>
          </string-name>
          , J.:
          <article-title>Towards integrating fuzzy logic capabilities into an ontology-based inductive logic programming framework</article-title>
          .
          <source>In: Proc. of the 11th Int. Conf. on Intelligent Systems Design and Applications</source>
          . IEEE Press (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Kietz</surname>
            ,
            <given-names>J.U.</given-names>
          </string-name>
          :
          <article-title>Learnability of description logic programs</article-title>
          . In: Matwin,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Sammut</surname>
          </string-name>
          , C. (eds.)
          <article-title>Inductive Logic Programming</article-title>
          , 12th International Conference, ILP 2002, Sydney, Australia, July 9-
          <issue>11</issue>
          ,
          <year>2002</year>
          .
          <source>Revised Papers. Lecture Notes in Computer Science</source>
          , vol.
          <volume>2583</volume>
          , pp.
          <volume>117</volume>
          {
          <fpage>132</fpage>
          . Springer (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Konstantopoulos</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Charalambidis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Formulating description logic learning as an inductive logic programming task</article-title>
          .
          <source>In: Proc. of the 19th IEEE Int. Conf. on Fuzzy Systems</source>
          . pp.
          <volume>1</volume>
          {
          <issue>7</issue>
          . IEEE Press (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Lang</surname>
            ,
            <given-names>J</given-names>
          </string-name>
          . (ed.)
          <source>: Proceedings of the Twenty-Seventh International Joint Conference on Arti cial Intelligence</source>
          ,
          <source>IJCAI 2018, July 13-19</source>
          ,
          <year>2018</year>
          , Stockholm, Sweden. ijcai.
          <source>org</source>
          (
          <year>2018</year>
          ), http://www.ijcai.org/proceedings/2018/
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>DL-Learner: Learning Concepts in Description Logics</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          <volume>10</volume>
          ,
          <volume>2639</volume>
          {
          <fpage>2642</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          :
          <article-title>Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming</article-title>
          .
          <source>Theory and Practice of Logic Programming</source>
          <volume>8</volume>
          (
          <issue>03</issue>
          ),
          <volume>271</volume>
          {
          <fpage>300</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          :
          <article-title>Inductive Logic Programming in Databases: From Datalog to DL+log</article-title>
          .
          <source>Theory and Practice of Logic Programming</source>
          <volume>10</volume>
          (
          <issue>3</issue>
          ),
          <volume>331</volume>
          {
          <fpage>359</fpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          :
          <string-name>
            <surname>AL-QuIn</surname>
          </string-name>
          :
          <article-title>An Onto-Relational Learning System for Semantic Web Mining</article-title>
          .
          <source>International Journal on Semantic Web and Information Systems</source>
          <volume>7</volume>
          (
          <issue>3</issue>
          ),
          <volume>1</volume>
          {
          <fpage>22</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          :
          <article-title>A declarative modeling language for concept learning in description logics</article-title>
          . In: Riguzzi,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Zelezny</surname>
          </string-name>
          ,
          <string-name>
            <surname>F</surname>
          </string-name>
          . (eds.)
          <article-title>Inductive Logic Programming</article-title>
          , 22nd International Conference, ILP 2012, Dubrovnik, Croatia,
          <source>September 17-19</source>
          ,
          <year>2012</year>
          ,
          <source>Revised Selected Papers. Lecture Notes in Computer Science</source>
          , vol.
          <volume>7842</volume>
          . Springer Berlin Heidelberg (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          :
          <article-title>Learning onto-relational rules with inductive logic programming</article-title>
          . In: Lehmann,
          <string-name>
            <surname>J.</surname>
          </string-name>
          , Volker, J. (eds.)
          <article-title>Perspectives on Ontology Learning, Studies on the Semantic Web</article-title>
          , vol.
          <volume>18</volume>
          , pp.
          <volume>93</volume>
          {
          <fpage>111</fpage>
          . IOS Press/AKA (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          :
          <article-title>Mining the web of data with metaqueries</article-title>
          . In: Riguzzi,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Bellodi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Zese</surname>
          </string-name>
          ,
          <string-name>
            <surname>R</surname>
          </string-name>
          . (eds.)
          <article-title>Up-and-</article-title>
          <string-name>
            <surname>Coming</surname>
          </string-name>
          and
          <article-title>Short Papers of the 28th International Conference on Inductive Logic Programming (ILP</article-title>
          <year>2018</year>
          ), Ferrara, Italy, September 2-
          <issue>4</issue>
          ,
          <year>2018</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>2206</volume>
          , pp.
          <volume>92</volume>
          {
          <fpage>99</fpage>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2018</year>
          ), http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2206</volume>
          /paper8.pdf
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malerba</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Inducing Multi-Level Association Rules from Multiple Relations</article-title>
          .
          <source>Machine Learning</source>
          <volume>55</volume>
          ,
          <volume>175</volume>
          {
          <fpage>210</fpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mencar</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>A granular computing method for OWL ontologies</article-title>
          .
          <source>Fundamenta Informaticae</source>
          <volume>159</volume>
          (
          <issue>1</issue>
          {2),
          <volume>147</volume>
          {
          <fpage>174</fpage>
          (
          <year>2018</year>
          ). https://doi.org/10.3233/ FI-2018-1661
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Straccia</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>A logic-based computational method for the automated induction of fuzzy ontology axioms</article-title>
          .
          <source>Fundamenta Informaticae</source>
          <volume>124</volume>
          (
          <issue>4</issue>
          ),
          <volume>503</volume>
          {
          <fpage>519</fpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Straccia</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>Learning in description logics with fuzzy concrete domains</article-title>
          .
          <source>Fundamenta Informaticae</source>
          <volume>140</volume>
          (
          <issue>3-4</issue>
          ),
          <volume>373</volume>
          {
          <fpage>391</fpage>
          (
          <year>2015</year>
          ). http://dx.doi.org/ 10.3233/FI-2015-1259
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          :
          <article-title>A model+solver approach to concept learning</article-title>
          . In: Adorni,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Cagnoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Gori</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Maratea</surname>
          </string-name>
          , M. (eds.)
          <source>AI*IA</source>
          <year>2016</year>
          :
          <article-title>Advances in Arti cial Intelligence - XVth International Conference of the Italian Association for Arti cial Intelligence</article-title>
          , Genova, Italy,
          <source>November 29 - December 1</source>
          ,
          <year>2016</year>
          ,
          <source>Proceedings. Lecture Notes in Computer Science</source>
          , vol.
          <volume>10037</volume>
          , pp.
          <volume>266</volume>
          {
          <fpage>279</fpage>
          . Springer (
          <year>2016</year>
          ), http://dx.doi.org/ 10.1007/978-3-
          <fpage>319</fpage>
          -49130-1_
          <fpage>20</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mencar</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Introducing fuzzy quanti cation in OWL 2 ontologies</article-title>
          . In: Monica,
          <string-name>
            <given-names>D.D.</given-names>
            ,
            <surname>Murano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Rubin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Sauro</surname>
          </string-name>
          ,
          <string-name>
            <surname>L</surname>
          </string-name>
          . (eds.)
          <source>Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017</source>
          IEEE International Workshop on Measurements and
          <string-name>
            <surname>Networking (2017 IEEE M&amp;N)</surname>
          </string-name>
          , Naples, Italy,
          <source>September 26-28</source>
          ,
          <year>2017</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <year>1949</year>
          , pp.
          <volume>321</volume>
          {
          <fpage>325</fpage>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2017</year>
          ), http://ceur-ws.
          <source>org/</source>
          Vol-1949/CILCpaper08.pdf
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Lisi</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Straccia</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>A FOIL-like Method for Learning under Incompleteness and Vagueness</article-title>
          . In: Zaverucha,
          <string-name>
            <surname>G.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Santos</given-names>
            <surname>Costa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            ,
            <surname>Paes</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <source>Inductive Logic Programming - 23rd International Conference, ILP</source>
          <year>2013</year>
          , Rio de Janeiro, Brazil,
          <source>August 28-30</source>
          ,
          <year>2013</year>
          ,
          <source>Revised Selected Papers. Lecture Notes in Computer Science</source>
          , vol.
          <volume>8812</volume>
          , pp.
          <volume>123</volume>
          {
          <fpage>139</fpage>
          . Springer (
          <year>2014</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>662</fpage>
          -44923- 3 9
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Lloyd</surname>
            ,
            <given-names>J.W.</given-names>
          </string-name>
          :
          <article-title>Foundations of Logic Programming</article-title>
          . Springer, 2nd edn. (
          <year>1987</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Motik</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosati</surname>
          </string-name>
          , R.:
          <article-title>Reconciling description logics and rules</article-title>
          .
          <source>J. ACM</source>
          <volume>57</volume>
          (
          <issue>5</issue>
          ) (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Muggleton</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Raedt</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poole</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Bratko, I.,
          <string-name>
            <surname>Flach</surname>
            ,
            <given-names>P.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Inoue</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Srinivasan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>ILP turns 20 - Biography and future challenges</article-title>
          .
          <source>Machine Learning 86(1)</source>
          ,
          <volume>3</volume>
          {
          <fpage>23</fpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Muggleton</surname>
            ,
            <given-names>S.H.:</given-names>
          </string-name>
          <article-title>Inductive logic programming</article-title>
          . In: Arikawa,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Goto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Ohsuga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Yokomori</surname>
          </string-name>
          , T. (eds.)
          <source>Proceedings of the 1st Conference on Algorithmic Learning Theory</source>
          . Springer/Ohmsma (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Muggleton</surname>
            ,
            <given-names>S.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Meta-interpretive learning of higher-order dyadic datalog: Predicate invention revisited</article-title>
          . In: Rossi,
          <string-name>
            <surname>F</surname>
          </string-name>
          . (ed.)
          <source>IJCAI</source>
          <year>2013</year>
          ,
          <source>Proceedings of the 23rd International Joint Conference on Arti cial Intelligence</source>
          , Beijing, China,
          <source>August 3-9</source>
          ,
          <year>2013</year>
          . IJCAI/AAAI (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Quinlan</surname>
            ,
            <given-names>J.R.</given-names>
          </string-name>
          :
          <article-title>Learning logical de nitions from relations</article-title>
          .
          <source>Machine Learning</source>
          <volume>5</volume>
          ,
          <volume>239</volume>
          {
          <fpage>266</fpage>
          (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38.
          <string-name>
            <surname>Riguzzi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bellodi</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zese</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>A history of probabilistic inductive logic programming</article-title>
          .
          <source>Frontiers in Robotics and AI</source>
          <year>2014</year>
          (
          <year>2014</year>
          ). http://dx.doi.org/10. 3389/frobt.
          <year>2014</year>
          .00006
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Rouveirol</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ventos</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Towards Learning in CARIN-ALN</article-title>
          . In: Cussens,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Frisch</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.M.</surname>
          </string-name>
          <article-title>(eds.) Inductive Logic Programming</article-title>
          , 10th International Conference,
          <string-name>
            <surname>ILP</surname>
          </string-name>
          <year>2000</year>
          , London, UK,
          <source>July 24-27</source>
          ,
          <year>2000</year>
          ,
          <source>Proceedings. Lecture Notes in Arti cial Intelligence</source>
          , vol.
          <year>1866</year>
          , pp.
          <volume>191</volume>
          {
          <fpage>208</fpage>
          . Springer (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          40.
          <string-name>
            <surname>Straccia</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>All about fuzzy description logics and applications</article-title>
          . In: Faber,
          <string-name>
            <given-names>W.</given-names>
            ,
            <surname>Paschke</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <article-title>Reasoning Web</article-title>
          . Web Logic Rules - 11th
          <source>International Summer School</source>
          <year>2015</year>
          , Berlin, Germany,
          <source>July 31 - August 4</source>
          ,
          <year>2015</year>
          ,
          <string-name>
            <given-names>Tutorial</given-names>
            <surname>Lectures</surname>
          </string-name>
          .
          <source>Lecture Notes in Computer Science</source>
          , vol.
          <volume>9203</volume>
          , pp.
          <volume>1</volume>
          {
          <fpage>31</fpage>
          . Springer (
          <year>2015</year>
          ). http://dx.doi. org/10.1007/978-3-
          <fpage>319</fpage>
          -21768-0
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>