<!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>Referring Expressions in Ontologies and Query Answering (a tutorial)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>David TOMAN</string-name>
          <email>david@uwaterloo.ca</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Grant WEDDELL</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Cheriton School of Computer Science, University of Waterloo</institution>
          ,
          <country country="CA">Canada</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>How individuals are identified when cooperating agents need to communicate is an inherent issue faced by the designers of information systems. Solutions to this problem range from insisting on global often opaque identifiers, such as URIs, to application specific ways of externally identifying individuals, such as primary keys in relational systems. The goal of this tutorial is to introduce a flexible framework based on referring expressions that unifies approaches that address these issues.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction and Goals</title>
      <p>A referring expression in linguistics is any noun phrase identifying an object in a way that
will be useful to interlocutors. In the context of a knowledge base K, commonly captured
using a first order theory, constant symbols occurring in K are the artifacts usually used
to identify a subset of the objects for which K captures knowledge.</p>
      <p>
        In this tutorial, we explore how the class of objects that can be usefully identified
can be extended by allowing a variety of more general formulas in the language of K,
called singular referring expressions, to replace constants as syntactic identifiers of such
objects. In particular, we lay a foundation for admitting singular referring expressions in
certain answer computation for queries over K. An integral part of this foundation are
characterization theorems for identification properties of singular referring expressions
for queries annotated with a domain specific language for referring expression types [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
We apply this framework in the context of tractable knowledge representation languages
based on description logics that are fragments of first order logic, showing in these cases
how identification properties can be determined at compile-time for conjunctive queries,
and how off-the-shelf conjunctive query answering approaches for such logics, such as
perfect rewriting, can be used in query evaluation [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. We also show that the extension
does not negatively impact the computational properties of the underlying logic.
      </p>
      <p>
        We then apply the work on referring expression types to the issue of identification
in conceptual modelling. In particular, we consider how such types yield a separation
of concerns in a setting where an information system based on an ontology or
conceptual schema is to be mapped to a relational schema that is then queried using relational
queries. We start from a simple object-centered representation common in ontologies and
in virtually all semantic data models where, since objects are self identified, naming is
not an issue. We then allow the analyst to attach referring expression types to classes,
and to specify appropriate uniqueness constraints to satisfy the requirements on referring
expressions. Finally, we show: (a) how a number of well-formedness conditions
concerning an assignment of referring expressions can be efficiently diagnosed, and (b) how
the above types attached to classes allow an automatic synthesis of a concrete relational
schema, and relational queries over that schema, from a combination of the conceptual
schema, a choice of referring expression types, and abstract “logical” queries over the
conceptual schema [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>We conclude by considering variations on referring expressions in situations in
which singularity can be relaxed, and therefore extend the applicability of the framework
to weaker knowledge representation languages.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Outline of the Tutorial</title>
      <p>The tutorial focuses on foundational issues relating to object identification in ontologies
and information systems based on ontologies, and on how such issues can be
comprehensively addressed. The approach to object identification discussed in the tutorial naturally
and seamlessly complements standard approaches in ontology design.</p>
      <p>What is a referring expression? We start with an introduction and overview of how
well formed formulae that satisfy certain properties, in particular singularity—the
property stating that the expression describes a single individual in every model
of a knowledge base—can serve as referring expressions in information systems
whose underlying ontologies correspond to first order knowledge bases.
Background. We introduce formal properties of referring expressions and show how
they can be determined. We then discuss how referring expressions can be
computed, in particular when K conforms to a decidable fragment of first order logic,
and more generic characterizations of varieties of referring expressions in the
conceptual modelling of information systems. We also review past work on
determining referring expressions in the context of knowledge bases and position these
approaches among other approaches designed to indirectly and/or symbolically
capture identities of (sets of) objects.</p>
      <p>Referring expressions and query answering. We show how referring expressions can
be used to enrich query answers over knowledge bases by allowing to refer to
answer objects that may not have an explicit name within the knowledge base K,
or for which a more preferred way of communicating its identity is available. To
control the form of the answers, we define a type language that describes varieties
of referring expressions desired in query answers. How these types are used to
adorn free variables in queries over K is presented. This includes an overview of
cases in which K conforms to a description logic and how computation issues are
then resolved by off-the-shelf technology for the logic.</p>
      <p>Referring expressions in conceptual modelling. Next, we explore the benefits of
adopting referring expression types for use in information systems derived from
conceptual modelling. In particular, we show how this approach can separate the purely
conceptual ontology design from issues connected with how objects are
identified within an eventual information system based on the design. Results on how
this enables a more wide spectrum use of SQL in defining information retrieval
requirements is also presented.</p>
      <p>Referring expressions for light knowledge representation formalisms. Finally, we
discuss variations on the singularity requirement for referring expressions: we
show that in certain situations, such as in the case of certain answers, the
singularity condition can be weakened to require singularity of individual certain answers
rather than singularity in every model of the knowledge base K. This allows us to
extend our results to knowledge bases formulated in weaker formalisms, such as
the various light-weight Description Logics, e.g., those that lack the capability of
enforcing functionality of binary predicates/roles.</p>
      <p>Open problems. We conclude the tutorial with an outline of directions for further
research, and with a list of open issues related to the use of referring expressions in
ontology-based information systems.</p>
      <p>
        The tutorial also links the proposed framework to existing approaches to managing
identities of objects in information systems, in particular of those based on knowledge bases
or other logic-backed systems, e.g., [
        <xref ref-type="bibr" rid="ref1 ref10 ref11 ref2 ref3 ref6 ref7 ref8 ref9">1,2,3,6,7,8,9,10,11</xref>
        ].
Dr. David Toman and Dr. Grant Weddell are professors of Computer Science at the
University of Waterloo. Together with Alexander Borgida (Rutgers), they have introduced
referring expressions in the area of Ontology-based data access (OBDA) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and received
the Ray Reiter Best Paper prize at KR 2016 for this work. They subsequently extended
this work to the area of conceptual modelling [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and other areas connected with
ontological reasoning and knowledge representation. They have published and presented results
in the area of knowledge representation over the last 20 years at premier AI conferences
(including another Reiter prize in 2010); Dr. Toman has also given tutorials in the area of
temporal representation and reasoning that has led to an invited chapter in the Handbook
of Temporal Reasoning in Artificial Intelligence.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Carlos</given-names>
            <surname>Areces</surname>
          </string-name>
          , Santiago Figueira, and Daniel Gor´ın.
          <article-title>Using logic in the generation of referring expressions</article-title>
          .
          <source>In Logical Aspects of Computational Linguistics - 6th International Conference, LACL 2011</source>
          , pages
          <fpage>17</fpage>
          -
          <lpage>32</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Carlos</given-names>
            <surname>Areces</surname>
          </string-name>
          , Alexander Koller, and
          <string-name>
            <given-names>Kristina</given-names>
            <surname>Striegnitz</surname>
          </string-name>
          .
          <article-title>Referring expressions as formulas of description logic</article-title>
          .
          <source>In INLG 2008 - Proceedings of the Fifth International Natural Language Generation Conference</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Alexander</given-names>
            <surname>Borgida</surname>
          </string-name>
          .
          <article-title>Description logics in data management. Knowledge and Data Engineering</article-title>
          , IEEE Transactions on,
          <volume>7</volume>
          (
          <issue>5</issue>
          ):
          <fpage>671</fpage>
          -
          <lpage>682</lpage>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Alexander</given-names>
            <surname>Borgida</surname>
          </string-name>
          , David Toman,
          <string-name>
            <given-names>and Grant</given-names>
            <surname>Weddell</surname>
          </string-name>
          .
          <article-title>On referring expressions in query answering over first order knowledge bases</article-title>
          .
          <source>In Principles of Knowledge Representation and Reasoning</source>
          , Cape Town,
          <string-name>
            <surname>SA</surname>
          </string-name>
          , pages
          <fpage>319</fpage>
          -
          <lpage>328</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Alexander</given-names>
            <surname>Borgida</surname>
          </string-name>
          , David Toman, and
          <string-name>
            <given-names>Grant E.</given-names>
            <surname>Weddell</surname>
          </string-name>
          .
          <article-title>On referring expressions in information systems derived from conceptual modelling</article-title>
          .
          <source>In Conceptual Modeling - 35th International Conference, ER</source>
          <year>2016</year>
          , Gifu, Japan, pages
          <fpage>183</fpage>
          -
          <lpage>197</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Giancarlo</given-names>
            <surname>Guizzardi</surname>
          </string-name>
          , Gerd Wagner, Nicola Guarino, and Marten van Sinderen.
          <article-title>An ontologically wellfounded profile for UML conceptual models</article-title>
          .
          <source>In Advanced Information Systems Engineering, CAiSE</source>
          <year>2004</year>
          , pages
          <fpage>112</fpage>
          -
          <lpage>126</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Terry</surname>
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Halpin</surname>
          </string-name>
          .
          <article-title>Modeling of linguistic reference schemes</article-title>
          .
          <source>IJISMD</source>
          ,
          <volume>6</volume>
          (
          <issue>4</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>23</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Tomasz</given-names>
            <surname>Imielinski</surname>
          </string-name>
          .
          <article-title>Intelligent query answering in rule based systems</article-title>
          .
          <source>The Journal of Logic Programming</source>
          ,
          <volume>4</volume>
          (
          <issue>3</issue>
          ):
          <fpage>229</fpage>
          -
          <lpage>257</lpage>
          ,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Amihai</given-names>
            <surname>Motro</surname>
          </string-name>
          .
          <article-title>Intensional answers to database queries. Knowledge and Data Engineering</article-title>
          , IEEE Transactions on,
          <volume>6</volume>
          (
          <issue>3</issue>
          ):
          <fpage>444</fpage>
          -
          <lpage>454</lpage>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Kees</surname>
            <given-names>van Deemter</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Albert</surname>
            <given-names>Gatt</given-names>
          </string-name>
          , Ielka van der Sluis, and Richard Power.
          <article-title>Generation of referring expressions: Assessing the incremental algorithm</article-title>
          .
          <source>Cognitive Science</source>
          ,
          <volume>36</volume>
          (
          <issue>5</issue>
          ):
          <fpage>799</fpage>
          -
          <lpage>836</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Carlo</given-names>
            <surname>Zaniolo</surname>
          </string-name>
          .
          <article-title>The database language GEM</article-title>
          .
          <source>In ACM SIGMOD Int. Conf. on Management of Data</source>
          , pages
          <fpage>207</fpage>
          -
          <lpage>218</lpage>
          ,
          <year>1983</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>