<!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>Debugging classical ontologies using defeasible reasoning tools (extended abstract)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Simone Coetzer</string-name>
          <email>scoetzer50@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Katarina Britz</string-name>
          <email>abritz@sun.ac.za</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>CAIR</institution>
          ,
          <addr-line>Stellenbosch Univ.</addr-line>
          ,
          <country country="ZA">South Africa</country>
        </aff>
      </contrib-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Ontologies provide knowledge engineers with the ability to represent and
encode knowledge in a formal language so that it can be processed or ‘reasoned
over’ by a computer [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Notable benefits include the ability to source new
knowledge by making statements that are implicitly deduced explicitly available to the
end-user, to classify individuals or instances and to check the addition of new
knowledge for logical consistency [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Given the nature and goal of ontologies, a successful application of
ontologies relies on (1) representing as much relevant domain knowledge accurately
(2) while maintaining logical consistency. As the successful implementation of a
real-world ontology is likely to contain many concepts and intricate relationships
between the concepts, it is necessary to follow a methodology for debugging the
ontology [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. A myriad of ontology debugging approaches (some of them
instantiated in tools) have been developed to help the knowledge engineer pinpoint
the cause of logical inconsistencies and rectify them in a strategic way [
        <xref ref-type="bibr" rid="ref3 ref4 ref6">6, 3, 4</xref>
        ].
Usually, a Model-Based Diagnosis approach is followed to debug the ontology:
this involves finding the diagnosis which contains all minimal conflict sets; the
diagnosis is then presented to the knowledge engineer who will need to amend
the axioms by modifying or deleting certain axioms; once the ontology has been
amended, it is again checked whether an inconsistency is present - if it is, the
process is repeated [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Although most ontology debugging approaches localise the faulty axioms,
they do not (to date) provide recommendations on how logical inconsistencies
can be resolved by weakening (instead of deleting) faulty axioms. We propose
a theoretical methodology for weakening faulty axioms in a strategic way using
defeasible reasoning tools. Our methodology draws from Rodler’s [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] interactive
ontology debugging approach which not only localises faulty axioms but provides
the knowledge engineer with a strategic way of resolving them by presenting the
root cause inconsistencies first. We are extending this approach by suggesting
that through the use of defeasible reasoning techniques, a methodology can be
created to systematically find conflict resolution recommendations.
      </p>
      <p>
        Importantly, our goal is not to convert a classical ontology to a defeasible
ontology - therefore we do not use defeasible reasoning support through, for
example, the computation of rational closure. Rather, we use the definition of
exceptionality of a concept, which is central to the semantics of defeasible DLs,
and the associated algorithm (as can be found in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]) to determine the extent
      </p>
      <p>Coetzer and Britz
of a concept’s exceptionality (their ranking); then, starting with the statements
containing the most general concepts (the least exceptional concepts) weakened
versions of the original statements are constructed; this is done until all
inconsistencies have been resolved. Consider how this methodology can be applied to
the following set of statements in an example ontology:</p>
    </sec>
    <sec id="sec-2">
      <title>U ser v :9AccessT o:Conf identialInf o</title>
    </sec>
    <sec id="sec-3">
      <title>Staf f v U ser</title>
    </sec>
    <sec id="sec-4">
      <title>Staf f v 9AccessT o:Conf identialInf o</title>
    </sec>
    <sec id="sec-5">
      <title>BlackListedStaf f v Staf f</title>
    </sec>
    <sec id="sec-6">
      <title>BlackListedStaf f v :9AccessT o:Conf identialInf o</title>
      <p>When running the ranking algorithm, the concept ‘User’ is the most general
exceptional concept; the concept ‘Staff’ is more exceptional than the concept
of ‘User’. Starting with the least exceptional concept, ‘User’, we then weaken
statements containing this concept on the left hand side of the axiom by using
a conjunction between the current concept under investigation and the negation
of the concept associated with it on the next level of exceptionality (Staff) - in
this phase, the ontology is transformed as follows:</p>
    </sec>
    <sec id="sec-7">
      <title>U ser u :Staf f v :9AccessT o:Conf identialInf o</title>
    </sec>
    <sec id="sec-8">
      <title>Staf f v U ser</title>
    </sec>
    <sec id="sec-9">
      <title>Staf f v 9AccessT o:Conf identialInf o</title>
    </sec>
    <sec id="sec-10">
      <title>BlackListedStaf f v Staf f</title>
    </sec>
    <sec id="sec-11">
      <title>BlackListedStaf f v :9AccessT o:Conf identialInf o</title>
      <p>The ranking of all concepts is again calculated and the first exceptional
concept, ‘User’ has now been resolved. Then, we move onto the next concept, Staff,
which is now the most general exceptional concept. The same kind of
transformation is performed on axioms containing ‘Staff’ on the left hand side (with the
exclusion of axioms containing one of the previous exceptional statements on the
right hand side):</p>
    </sec>
    <sec id="sec-12">
      <title>U ser u :Staf f v :9AccessT o:Conf identialInf o</title>
    </sec>
    <sec id="sec-13">
      <title>Staf f u v U ser</title>
    </sec>
    <sec id="sec-14">
      <title>Staf f u :BlackListedStaf f v 9AccessT o:Conf identialInf o</title>
    </sec>
    <sec id="sec-15">
      <title>BlackListedStaf f v Staf f</title>
    </sec>
    <sec id="sec-16">
      <title>BlackListedStaf f v :9AccessT o:Conf identialInf o</title>
      <p>The forward-looking goal of this research is to provide a methodological
foundation which could, in future, lead to the development and implementation of
an inconsistency resolution recommender tool that is fully integrated with the
ontology development environment.</p>
      <p>Debugging classical ontologies using defeasible reasoning tools</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>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Description</surname>
            <given-names>Logics</given-names>
          </string-name>
          , in Staab, S. and
          <string-name>
            <surname>Studer</surname>
          </string-name>
          , R., eds, Handbook On Ontologies, Springer-Verlag, Berlin, Chapter 1, pp.
          <fpage>3</fpage>
          -
          <lpage>28</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Britz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Casini</surname>
          </string-name>
          , G., Meyer, T. and
          <string-name>
            <surname>Varzinczak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <article-title>A KLM perspective on defeasible reasoning for description logics</article-title>
          , in Lutz, C. and
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Tinelli</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Turhan</surname>
          </string-name>
          , A.-Y. and
          <string-name>
            <surname>Wolter</surname>
            , F., eds, Description Logic,
            <given-names>Theory</given-names>
          </string-name>
          <string-name>
            <surname>Combination</surname>
            , and
            <given-names>All</given-names>
          </string-name>
          <string-name>
            <surname>That</surname>
          </string-name>
          . Essays Dedicated to Franz
          <source>Baader on the Occasion of His 60th Birthday</source>
          , pp.
          <fpage>147</fpage>
          -
          <lpage>173</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Friedrich</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Schekotykhin</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>A General</given-names>
            <surname>Diagnosis</surname>
          </string-name>
          <article-title>Method for Ontologies</article-title>
          ,
          <source>Proceedings of the 4th International Semantic Web Conference (ISWC</source>
          <year>2005</year>
          ),
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Kalyanpur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parsia</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horridge</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Sirin</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <article-title>Finding all Justifications of OWL DL Entailments, The Semantic Web</article-title>
          , 6th International Semantic Web Conference,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Rodler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Interactive Debugging of Knowledge Bases,
          <source>PhD thesis</source>
          : Alpen-Adria University Klagenfurt,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Schlobach</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cornet</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Harmelen</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Debugging Incoherent</surname>
            <given-names>Terminologies</given-names>
          </string-name>
          ,
          <source>Journal of Automated Reasoning</source>
          , Volume
          <volume>39</volume>
          , pp.
          <fpage>317</fpage>
          -
          <lpage>349</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Studer</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Benjamins</surname>
            ,
            <given-names>V.R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Fensel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knowledge</surname>
            <given-names>Engineering</given-names>
          </string-name>
          :
          <article-title>Principles and Methods, Data and Knowledge Engineering</article-title>
          , Volume
          <volume>25</volume>
          , pp.
          <fpage>161</fpage>
          -
          <lpage>197</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>