<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Reasoning in Description Logics with Exceptions: Extended Abstract</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Gabriele Sacco</string-name>
          <email>gsacco@fbk.eu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Fondazione Bruno Kessler</institution>
          ,
          <addr-line>Via Sommarive 18, 38123 Trento</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Free University of Bozen-Bolzano</institution>
          ,
          <addr-line>Piazza Domenicani 3, 39100, Bolzano</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The problem of representing defeasible information is a long-standing topic of discussion in Knowledge Representation: for example, considering logic-based ontology representation languages, in Description Logics many proposals for defining defeasibility have been formalised, mostly emerging from existing approaches from the non-monotonic logic literature. On the other hand, little attention has been devoted to study the capability of these approaches in capturing the interpretation of exceptions from a formal ontological and cognitive point of view.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>Motivation</title>
      <p>
        Representing and reasoning with defeasible information is a long-standing topic of discussion in
Artificial Intelligence (AI), dating back to the origins of the field of Knowledge Representation
(KR): in presence of stronger conflicting information (or exceptions) with such defeasible
information, one wants to retract what we would have inferred in view of new information. In
its formalisation in diferent non-monotonic logics [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], this form of reasoning has been considered
since the earliest days of KR as one of the parts of the common-sense that artificial systems
should have to be considered actually intelligent [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]. The classical example in the
nonmonotonic logics literature is the Penguin example (see, e.g., [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]): if we know that Tweety is a
bird and we also know that birds fly, then we are willing to infer that Tweety flies. However, if
we come to know that Tweety is in fact a penguin, this makes us retract the previous conclusion:
we are more inclined to say that Tweety does not fly instead.
      </p>
      <p>
        Considering logic-based ontology representation languages, in Description Logics (DLs)
many proposals for defining defeasibility have been formalised: as a matter of fact, most of
them emerge from existing approaches in non-monotonic logics [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ]. On the other hand,
little attention has been devoted to study the capability of these approaches in capturing the
FOIS 2023 Early Career Symposium (ECS), held at FOIS 2023, co-located with 9th Joint Ontology Workshops (JOWO
CEUR
Workshop
Proceedings
      </p>
      <p>
        © 2023 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
interpretation of exceptions from the point of view of formal ontology and cognitive aspects [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
Thus, often a lack of discussion about the philosophical and cognitive assumptions of this kind
of reasoning is noted. Namely, when looking at non-monotonic logic only as a tool, evaluating
the systems with the sole criterion of evaluation to check the functionality of the particular
formal system proposed w.r.t. a particular reasoning problem, we end up with a fragmented
set of approaches. This, clearly, increases the dificulty of comparing and therefore properly
evaluating comparatively such systems from a more general point of view. Moreover, since in
the end these tools should be used to model knowledge and reason in real-world scenarios, we
also need criteria that allow us to decide if the ontological and cognitive assumptions that the
formal systems imply are justified or not. For these reasons, I am interested in discussing these
foundational aspects of defeasible reasoning in DLs with the goal of developing a DL system
based on an ontologically and cognitively well-justified foundation.
2. Research Questions
(Q1): What are the characteristics of non-monotonic reasoning from the philosophical and
cognitive points of view?
(Q2): How can we model non-monotonic reasoning in Description Logics in order to capture
the features we discovered in the philosophical and cognitive analysis?
(Q3): How can we implement the formal model developed with respect to Description Logics
in an automated reasoning system?
(Q4): How can our formal reasoning about exceptions be evaluated with respect to psychological
and/or common-sense reasoning results coming from a study with human reasoners?
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Objective(s)</title>
      <p>The first objective to be obtained at the end of the project is to have a set of theoretical properties
extracted from the related literature in philosophy and cognitive science that will be used as a
theoretical benchmark to compare the formal approaches for non-monotonic reasoning in DLs.
The second goal is to develop a formal model in Description Logics that satisfies the theoretical
features extracted. Thirdly, I would like to implement a system for automated reasoning for the
proposed non-monotonic Description Logics extension. Finally, the last objective is to have an
evaluation, in the form of a user study, assessing the compliance to the desiderata and human
reasoning.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Research Methodology</title>
      <p>In general, given the strong theoretical characterisation of the research, the main methods to
answer the questions would be literature review and developing formal models with DLs.</p>
      <p>In particular, for (Q1) I am studying sources from the fields of philosophy, cognitive sciences
and theoretical computer science, in order to discuss the analysis of defeasible reasoning in
these fields and extract the theoretical desiderata that a KR formal model should satisfy.
More specifically, I discussed the main literature on generics (e.g. [ 8, 7, 9]), that is sentences that
express generalisations that admit exceptions. They are strictly related to defeasible reasoning
[9] and from their analysis I extracted some possible desiderata to discuss further with respect
to other fields too. Now I am studying the literature in the psychology of reasoning to research
what considerations have been made on this kind of reasoning. In particular, I am exploring the
results of some experiments aimed at comparing logical theories of defeasible reasoning and
human reasoning [12, 11, 10].</p>
      <p>In this phase, it will be important to compare the results with solutions present in the literature
on DLs, in order to evaluate the validity and the usefulness of the theoretical grounding attempt.</p>
      <p>For (Q2), I will proceed with the modelling in the formalism of DLs based on the comparison
conducted previously in the answer to (Q1). Moreover, the resulting model could be applied to
a specific ontological theory to understand better possible shortcomings or flaws. In this case,
mereology could be a good candidate given the lively interest in the topic by research both in
philosophy and in AI.</p>
      <p>(Q3) relies heavily on the answer to (Q2). In fact, my plan is to use the formalisation in
DLs and to develop an implementation of reasoning procedures in Answer Set Programming.
This will be addressed by comparing the techniques used in automated reasoning in order to
elaborate the most fitting one for my problem.</p>
      <p>Finally, (Q4) aims at assessing our work, by evaluating the results obtained in the answers to
the previous three questions with respect to cognitive results. The way to answer this question
will depend on the actual results obtained. However, a criterion that could be tested is the
generality of exception types dealt with by the automated reasoning tool and by humans.
in: Nicholson, A., Li, X. (eds), AI 2009: Advances in Artificial Intelligence , Berlin, Heidelberg:
Springer Berlin Heidelberg, 506-516, https://doi.org/10.1007/978-3-642-10439-8_51.
[7] Leslie, S. J. (2008), Generics: Cognition and acquisition, in: Philosophical Re- view 117.1,
1-47.
[8] Leslie, S. J. and Lerner, A. (2022), Generic Generalizations, The Stanford Encyclopedia of
Philosophy (Fall 2022 Edition), Edward N. Zalta Uri Nodelman (eds.), https://plato.stanford.
edu/archives/fall2022/entries/generics/.
[9] Pelletier, F. J. and Asher, N. (1997), Generics and defaults, in: Handbook of logic and language,
1125-1177, North-Holland.
[10] Ragni, M., Eichhorn, C., Bock, T., Kern-Isberner, G. and Tse, A. P. P. (2017), Formal
Nonmonotonic Theories and Properties of Human Defeasible Reasoning, in: Minds Machines
27, 79-117, https://doi.org/10.1007/s11023-016-9414-1.
[11] Ragni, M., Eichhorn, C., and Kern-Isberner, G. (2016), Simulating Human Inferences in
the Light of New Information: A Formal Analysis, in: Proceedings of the Twenty-Fifth
International Joint Conference on Artificial Intelligence (IJCAI’16) , New York, USA: AAAI
Press, 2604-2610.
[12] Kuhnmuench, G., and Ragni, M. (2014), Can Formal Non-monotonic Systems Properly
Describe Human Reasoning?, in: Proceedings of the Annual Meeting of the Cognitive Science
Society, 36 https://escholarship.org/uc/item/921558fg.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Khemlani</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Johnson-Laird</surname>
            ,
            <given-names>P.N.</given-names>
          </string-name>
          (
          <year>2019</year>
          ),
          <article-title>Why Machines Don't (yet) Reason Like People</article-title>
          ,
          <source>in Künstl Intell</source>
          <volume>33</volume>
          ,
          <fpage>219</fpage>
          -
          <lpage>228</lpage>
          , https://doi.org/10.1007/s13218-019-00599-w.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Strasser</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Antonelli</surname>
            ,
            <given-names>G. A.</given-names>
          </string-name>
          (
          <year>2019</year>
          ),
          <article-title>Non-monotonic Logic, The Stanford Encyclopedia of Philosophy (Summer 2019 Edition)</article-title>
          , Edward N. Zalta (ed.), https://plato.stanford.edu/ archives/sum2019/entries/logic-nonmonotonic/.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>McCarthy</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>1959</year>
          ),
          <article-title>Programs with common sense</article-title>
          ,
          <source>in: Proceedings of the Teddington Conference on the Mechanization of Thought Processes. London: Her Majesty's Stationary Ofice</source>
          ,
          <fpage>75</fpage>
          -
          <lpage>91</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>McCarthy</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Hayes</surname>
            ,
            <given-names>P. J.</given-names>
          </string-name>
          (
          <year>1969</year>
          ),
          <article-title>Some philosophical problems from the standpoint of artificial intelligence</article-title>
          ,
          <source>in Machine Intelligence</source>
          <volume>4</volume>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Meltzer</surname>
          </string-name>
          and D. Michie, eds., Edinburgh: Edinburgh University Press,
          <fpage>463</fpage>
          -
          <lpage>502</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <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>Lieto</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olivetti</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Pozzato</surname>
            ,
            <given-names>G. L.</given-names>
          </string-name>
          (
          <year>2020</year>
          ),
          <article-title>Reasoning about Typicality and Probabilities in Preferential Description Logics</article-title>
          , arXiv e-prints, https://doi. org/10.48550/arXiv.
          <year>2004</year>
          .
          <volume>09507</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Britz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heidema</surname>
          </string-name>
          , J., Meyer, T. (
          <year>2009</year>
          ), Modelling Object Typicality in Description Logics,
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>