<!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>Contextual rational closure for defeasible ALC (Extended Abstract)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Katarina Britz</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ivan Varzinczak</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stellenbosch Univ.</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>South Africa</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Univ. Artois</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>France abritz@sun.ac.za</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>varzinczak@cril.fr</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Description logics have been extended in a number of ways to support defeasible reasoning in the KLM tradition. Such features include preferential or rational defeasible concept inclusion, and defeasible roles in complex concept descriptions. Semantically, defeasible subsumption is obtained by means of a preference order on objects, while defeasible roles are obtained by adding a preference order to role interpretations. In this paper, we address an important limitation in defeasible extensions of description logics, namely the restriction in the semantics of defeasible concept inclusion to a single preference order on objects. We do this by inducing a modular preference order on objects from each modular preference order on roles, and using these to relativise defeasible subsumption. This yields a notion of contextual rational defeasible subsumption, with contexts described by roles. We also provide a semantic construction for rational closure and a method for its computation, and present a correspondence result between the two.</p>
      </abstract>
      <kwd-group>
        <kwd>description logics</kwd>
        <kwd>non-monotonic reasoning</kwd>
        <kwd>defeasible subsumption</kwd>
        <kwd>preferential semantics</kwd>
        <kwd>rational closure</kwd>
        <kwd>context</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Given the special status of concept inclusion in description logics (DLs), and
the historical importance of entailment in logic in general, past research efforts
to extend DLs with non-monotonic reasoning capabilities have focused
primarily on accounts of defeasible subsumption and the characterisation of defeasible
entailment. Semantically, the latter usually takes as point of departure an
ordering on a class of first-order interpretations [
        <xref ref-type="bibr" rid="ref16 ref18">16, 18</xref>
        ], whereas the former usually
assume a preference order on objects of the domain [
        <xref ref-type="bibr" rid="ref14 ref5">5, 14</xref>
        ].
      </p>
      <p>
        Recently, we proposed a new direction to introduce defeasibility to DLs [
        <xref ref-type="bibr" rid="ref6 ref7">6,
7</xref>
        ]. This built on previous work to resolve two important ontological limitations
of the preferential approach to defeasible DLs — the assumption of a single
preference order on all objects in the domain of interpretation, and the assumption
that defeasibility is intrinsically linked to arguments or conditionals [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ].
      </p>
      <p>
        We achieved this by introducing defeasibility in the concept language via
an intuitive notion of normality for roles [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. This parameterised the idea of
preference while at the same time introducing the notion of defeasible class
membership — defeasible subsumption allows for the expression of statements
      </p>
      <p>
        Britz and Varzinczak
of the form “ C is usually subsumed by D”, for example, “Chenin blanc wines are
usually unwooded”. In the extended language, one can also refer directly to, for
example, “Chenin blanc wines that usually have a wood aroma”. These notions
can also be combined seamlessly, as in: “Chenin blanc wines that usually have a
wood aroma are usually wooded”. This cannot be expressed in terms of
defeasible subsumption alone, nor can it be expressed w.l.o.g. using typicality-based
operators [
        <xref ref-type="bibr" rid="ref14 ref15 ref2 ref20">2, 14, 15, 20</xref>
        ] on concepts, because the semantics of the expression is
inextricably tied to the two distinct uses of the term ‘usually’.
      </p>
      <p>Nevertheless, even this generalisation left open the question of different,
possibly incompatible, semantic characterisations of defeasibility in subsumption. A
single ordering on individuals, as is usually assumed, does not suffice when
preferences depend on context. In this paper, we therefore propose to induce multiple
preference orders on objects derived from preference orders on role
interpretations, and use these to relativise defeasible subsumption. This yields a notion of
contextual defeasible subsumption, with contexts indicated by role names.</p>
      <p>
        Building on previous work in the KLM tradition, we show that restricting the
preferential semantics to a modular semantics allows us to define and compute a
notion of rational entailment from a defeasible knowledge base. Rational closure
is a form of inferential closure studied by Lehmann and Magidor [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], which is
based on modular entailment but it extends its inferential power. Our proposal
is a generalisation of the DL version of propositional rational closure. We present
a proof-theoretic characterisation, based on the work of Casini and Straccia [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ],
as well as a semantic characterisation, based on the work of Booth and Paris [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]
in the propositional case, and of Britz et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and Giordano et al. [
        <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
        ] in
the DL case. We then state and prove a correspondence result which relates the
computation of rational closure to the semantic construction.
      </p>
      <p>
        Defeasibility introduces a new facet of contextual reasoning not present in
deductive reasoning in that preference orders can be used to indicate context. While
an account of deductive reasoning with contexts in knowledge representation is
not intrinsically linked to defeasible reasoning, its integration with contextual
defeasible description logics warrants further investigation [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The present
paper [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] is a revised and extended version of a paper presented at FoIKS 2018 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
In related work [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], we address another important open question, namely the
creation of a tableau-based proof procedure for defeasible ALC.
      </p>
      <p>Contextual rational closure for defeasible ALC</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bonatti</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Rational closure for all description logics</article-title>
          .
          <source>Artificial Intelligence</source>
          <volume>274</volume>
          ,
          <fpage>197</fpage>
          -
          <lpage>223</lpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Booth</surname>
          </string-name>
          , R., Meyer, T.,
          <string-name>
            <surname>Varzinczak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>PTL: A propositional typicality logic</article-title>
          .
          <source>In: Fariñas del Cerro</source>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Herzig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Mengin</surname>
          </string-name>
          ,
          <string-name>
            <surname>J</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 13th European Conference on Logics in Artificial Intelligence (JELIA)</source>
          . pp.
          <fpage>107</fpage>
          -
          <lpage>119</lpage>
          . No. 7519
          <string-name>
            <surname>in</surname>
            <given-names>LNCS</given-names>
          </string-name>
          , Springer (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Booth</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , Paris, J.:
          <article-title>A note on the rational closure of knowledge bases with both positive and negative knowledge</article-title>
          .
          <source>Journal of Logic, Language and Information</source>
          <volume>7</volume>
          (
          <issue>2</issue>
          ),
          <fpage>165</fpage>
          -
          <lpage>190</lpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Britz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Casini</surname>
          </string-name>
          , G., Meyer, T.,
          <string-name>
            <surname>Moodley</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varzinczak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Ordered interpretations and entailment for defeasible description logics</article-title>
          .
          <source>Tech. rep., CAIR, CSIR Meraka and UKZN</source>
          ,
          <string-name>
            <surname>South Africa</surname>
          </string-name>
          (
          <year>2013</year>
          ), http://tinyurl.com/cydd6yy
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Britz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heidema</surname>
          </string-name>
          , J., Meyer, T.:
          <article-title>Semantic preferential subsumption</article-title>
          . In: Lang,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Brewka</surname>
          </string-name>
          ,
          <string-name>
            <surname>G</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR)</source>
          . pp.
          <fpage>476</fpage>
          -
          <lpage>484</lpage>
          . AAAI Press/MIT Press (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Britz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varzinczak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Introducing role defeasibility in description logics</article-title>
          . In: Michael,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Kakas</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 15th European Conference on Logics in Artificial Intelligence (JELIA)</source>
          . pp.
          <fpage>174</fpage>
          -
          <lpage>189</lpage>
          . No. 10021
          <string-name>
            <surname>in</surname>
            <given-names>LNCS</given-names>
          </string-name>
          , Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Britz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varzinczak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Toward defeasible SROIQ</article-title>
          . In: Artale,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Glim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Kontchakov</surname>
          </string-name>
          ,
          <string-name>
            <surname>R</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 30th International Workshop on Description Logics</source>
          . vol.
          <year>1879</year>
          . CEUR Workshop Proceedings (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Britz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varzinczak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>From KLM-style conditionals to defeasible modalities, and back</article-title>
          .
          <source>Journal of Applied Non-Classical Logics (JANCL) 28(1)</source>
          ,
          <fpage>92</fpage>
          -
          <lpage>121</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Britz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varzinczak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Preferential accessibility and preferred worlds</article-title>
          .
          <source>Journal of Logic</source>
          , Language and Information (JoLLI)
          <volume>27</volume>
          (
          <issue>2</issue>
          ),
          <fpage>133</fpage>
          -
          <lpage>155</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Britz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varzinczak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Rationality and context in defeasible subsumption</article-title>
          . In: Ferrarotti,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Woltran</surname>
          </string-name>
          , S. (eds.)
          <source>Proceedings of the 10th International Symposium on Foundations of Information and Knowledge Systems (FoIKS)</source>
          . pp.
          <fpage>114</fpage>
          -
          <lpage>132</lpage>
          . No. 10833
          <string-name>
            <surname>in</surname>
            <given-names>LNCS</given-names>
          </string-name>
          , Springer (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Britz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varzinczak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Contextual rational closure for defeasible ALC</article-title>
          .
          <source>Annals of Mathematics and Artificial Intelligence (AMAI)</source>
          (
          <year>2019</year>
          ), submitted
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Britz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varzinczak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Reasoning with contextual defeasible ALC</article-title>
          .
          <source>In: Proceedings of the 32nd International Workshop on Description Logics. CEUR Workshop Proceedings</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Casini</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Straccia</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>Defeasible inheritance-based description logics</article-title>
          .
          <source>Journal of Artificial Intelligence Research (JAIR) 48</source>
          ,
          <fpage>415</fpage>
          -
          <lpage>473</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Giordano</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gliozzi</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olivetti</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pozzato</surname>
          </string-name>
          , G.:
          <article-title>Preferential description logics</article-title>
          . In: Dershowitz,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Voronkov</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <article-title>Logic for Programming</article-title>
          ,
          <source>Artificial Intelligence, and Reasoning (LPAR)</source>
          . pp.
          <fpage>257</fpage>
          -
          <lpage>272</lpage>
          . No. 4790
          <string-name>
            <surname>in</surname>
            <given-names>LNAI</given-names>
          </string-name>
          , Springer (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Giordano</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gliozzi</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olivetti</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pozzato</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Reasoning about typicality in preferential description logics</article-title>
          . In: Hölldobler,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Lutz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Wansing</surname>
          </string-name>
          , H. (eds.)
          <source>Proceedings of the 11th European Conference on Logics in Artificial Intelligence (JELIA)</source>
          . pp.
          <fpage>192</fpage>
          -
          <lpage>205</lpage>
          . No. 5293
          <string-name>
            <surname>in</surname>
            <given-names>LNAI</given-names>
          </string-name>
          , Springer (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Giordano</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gliozzi</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olivetti</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pozzato</surname>
          </string-name>
          , G.:
          <article-title>A minimal model semantics for nonmonotonic reasoning</article-title>
          .
          <source>In: Fariñas del Cerro</source>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Herzig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Mengin</surname>
          </string-name>
          ,
          <string-name>
            <surname>J</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 13th European Conference on Logics in Artificial Intelligence (JELIA)</source>
          . pp.
          <fpage>228</fpage>
          -
          <lpage>241</lpage>
          . No. 7519
          <string-name>
            <surname>in</surname>
            <given-names>LNCS</given-names>
          </string-name>
          , Springer (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Giordano</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gliozzi</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olivetti</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pozzato</surname>
          </string-name>
          , G.:
          <article-title>A non-monotonic description logic for reasoning about typicality</article-title>
          .
          <source>Artificial Intelligence</source>
          <volume>195</volume>
          ,
          <fpage>165</fpage>
          -
          <lpage>202</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Giordano</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gliozzi</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olivetti</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pozzato</surname>
          </string-name>
          , G.:
          <article-title>Semantic characterization of rational closure: From propositional logic to description logics</article-title>
          .
          <source>Artificial Intelligence</source>
          <volume>226</volume>
          ,
          <fpage>1</fpage>
          -
          <lpage>33</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Magidor</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>What does a conditional knowledge base entail?</article-title>
          <source>Artificial Intelligence</source>
          <volume>55</volume>
          ,
          <fpage>1</fpage>
          -
          <lpage>60</lpage>
          (
          <year>1992</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Varzinczak</surname>
          </string-name>
          , I.:
          <article-title>A note on a description logic of concept and role typicality for defeasible reasoning over ontologies</article-title>
          .
          <source>Logica Universalis</source>
          <volume>12</volume>
          (
          <issue>3-4</issue>
          ),
          <fpage>297</fpage>
          -
          <lpage>325</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>