<!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>The Combined Approach to Query Answering in Horn-ALCHOI Q (Extended Abstract)?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>David Carral</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Irina Dragoste</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Markus Krotzsch</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Knowledge-Based Systems Group, TU Dresden</institution>
          ,
          <addr-line>Dresden</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Answering conjunctive queries (CQs) over Description Logics (DL) ontologies is an important reasoning task with many applications in knowledge representation. Intensive research e orts in recent years have signi cantly improved our understanding of this problem, and led to e cient algorithms and implementations for many DL languages [2,3]. Query rewriting was an important step towards widespread practical implementation in legacy databases, but it is limited to DLs of sub-polynomial data complexity. This limitation was overcome by the so-called combined approach, which answers CQs in two steps: 1. Materialisation: data is augmented to build a query-independent interpretation, which may not be a model but is complete for CQ answering. 2. Filtration: queries are evaluated over this interpretation and unsound answers are discarded in a ltration step.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>103
102
600
400
200
0
David Carral, Irina Dragoste, and Markus Krotzsch</p>
    </sec>
    <sec id="sec-2">
      <title>UOBM</title>
    </sec>
    <sec id="sec-3">
      <title>Reactome Uniprot</title>
      <p>
        Proof of Concept. We evaluate a prototype implementation of the
materialisation phase, which we consider the performance-critical part of our algorithm. In
contrast, our ltration phase uses a polynomial algorithm, which is
computationally similar to the ltration in other combined approaches that have already
been shown to be e cient in practical cases [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Since materialisation decides
fact entailment for Horn-ALCHOIQ, we can meaningfully compare performance
against standard DL reasoners. We use our implementation to solve assertion
retrieval, that is, the reasoning task that consists in computing all assertions that
are entailed by an ontology. We compare performance with that of Konclude
(v0.6.2) [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], which we use as a command-line client on local input les.
      </p>
      <p>
        Since CQ answering is most relevant in data-intensive applications, we
consider ontologies with large sets of assertions (ABoxes). We select a standard
benchmark, UOBM [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]; and two real-world ontologies, Reactome and Uniprot,
which are used in the evaluation of PAGOdA [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. The resulting ontologies
contain 254 (UOBM), 481 (Reactome), and 317 (Uniprot) terminological axioms,
respectively. None of these ontologies belong to a known tractable fragment of
Horn-ALCHOIQ. For each ontology, we consider ABoxes of various sizes,
generated by using the size parameter for the benchmark (UOBM), and by sampling
the real-world ABoxes (Reactome, Uniprot).
      </p>
      <p>Our test system is a commodity laptop (16GB RAM, 500GB SSD, CPU
i78550U/4 cores/1.8GHz, Windows 10), where we con gure the operating system
to allow up to 28GB of virtual memory. We measure wall-clock times spent
during reasoning, ignoring the time required for parsing and loading. Konclude
reports detailed times, while for our implementation we measure the time from
within our prototype. Figure 1 shows the results. Note the logarithmic scale in
the case of Reactome. Konclude ran out of memory for the two largest of the
Uniprot samples, hence no times are reported here. The performance results
show that our prototype can already achieve competitive performance.
Acknolwedgements. This work is supported by Deutsche Forschungsgemeinschaft
in project number 389792660 (TRR 248, Center for Perspicuous Systems) and
Emmy Noether grant KR 4381/1-1 (DIAMOND).</p>
      <p>The Combined Approach to Query Answering in Horn-ALCHOIQ</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Baader</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brandt</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lutz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Pushing the EL envelope</article-title>
          .
          <source>In: Proc. 19th Int. Joint Conf. on Arti cial Intelligence (IJCAI)</source>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bienvenu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hansen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lutz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolter</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>First order-rewritability and containment of conjunctive queries in Horn description logics</article-title>
          .
          <source>In: Proc. 25th Int. Joint Conf. on Arti cial Intelligence (IJCAI)</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Giacomo</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lembo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lenzerini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosati</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Tractable reasoning and e cient query answering in description logics: The DL-Lite family</article-title>
          .
          <source>Journal of Automated Reasoning</source>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Carral</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dragoste</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Krotzsch,
          <string-name>
            <surname>M.:</surname>
          </string-name>
          <article-title>The combined approach to query answering in horn-ALCHOIQ</article-title>
          .
          <source>In: Proc. 16th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR)</source>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Feier</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carral</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stefanoni</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Cuenca</given-names>
            <surname>Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Horrocks</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          :
          <article-title>The combined approach to query answering beyond the OWL 2 pro les</article-title>
          .
          <source>In: Proc. 24th Int. Joint Conf. on Arti cial Intelligence (IJCAI)</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kazakov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Consequence-driven reasoning for Horn-SHIQ ontologies</article-title>
          .
          <source>In: Proc. 21st Int. Joint Conf. on Arti cial Intelligence (IJCAI)</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kontchakov</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lutz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolter</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zakharyaschev</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The combined approach to ontology-based data access</article-title>
          .
          <source>In: Proc. 22nd Int. Joint Conf. on Arti cial Intelligence (IJCAI)</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. Krotzsch,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Rudolph</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Hitzler</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          :
          <article-title>Complexities of Horn DLs</article-title>
          .
          <source>ACM Transactions Computational Logic</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Lutz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seylan</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolter</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>The combined approach to OBDA: Taming role hierarchies using lters</article-title>
          .
          <source>In: Proc. 12th Int. Semantic Web Conf. (ISWC)</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Ma</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Qiu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xie</surname>
            ,
            <given-names>G.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pan</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Towards a complete OWL ontology benchmark</article-title>
          .
          <source>In: Proc. 3rd Int. Semantic Web Conf. (ESWC)</source>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Ortiz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rudolph</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simkus</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Worst-case optimal reasoning for the Horn-DL fragments of OWL 1 and 2</article-title>
          .
          <source>In: Proc. 12th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR)</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Ortiz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rudolph</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simkus</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Query answering in the Horn fragments of the description logics SHOIQ and SROIQ</article-title>
          .
          <source>In: Proc. 22nd Int. Joint Conf. on Arti cial Intelligence (IJCAI)</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Rudolph</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Glimm</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Nominals, inverses, counting, and conjunctive queries or: Why in nity is your friend!</article-title>
          <source>Journal of Arti cial Intelligence Research</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Simanc k</surname>
          </string-name>
          , F.,
          <string-name>
            <surname>Kazakov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Consequence-based reasoning beyond Horn ontologies</article-title>
          .
          <source>In: Proc. 22nd Int. Joint Conf. on Arti cial Intelligence (IJCAI)</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Stefanoni</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Motik</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Introducing nominals to the combined query answering approaches for EL</article-title>
          .
          <source>In: Proc. 27th (AAAI) Conf. on Arti cial Intelligence (AAAI)</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Steigmiller</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liebig</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Glimm</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Konclude: System description</article-title>
          .
          <source>Journal of Web Semantics</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuenca Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nenov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaminski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
          </string-name>
          , I.:
          <article-title>PAGOdA: Payas-you-go ontology query answering using a Datalog reasoner</article-title>
          .
          <source>Journal Arti cial Intelligence Research</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>