<!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>Mapping contexts to vocabularies to represent intentions</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Rallou Thomopoulos</string-name>
          <email>rallou@ensam.inra.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marie-Laure Mugnier</string-name>
          <email>mugnier@lirmm.fr</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michel Lecle`re</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>INRA (IATE Joint Research Unit) / Associate Researcher of LIRMM</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In the framework of multi-target use of a given ontology, this paper proposes a representation of vocabularies based on the identification of elementary vocabularies, which can be equivalently defined using specializations of the “kind of” relation. It defines a way of combining contexts and vocabularies that allows context-specific querying.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        A given assertion holds in a given “context”. This single affirmation
can be interpreted in various ways, leading to a disparate literature
about contexts. We can note two main considerations: (i) a given
assertion can lead to several interpretations due to different meanings
of terms, depending on the context [
        <xref ref-type="bibr" rid="ref1 ref4 ref8">1, 4, 8</xref>
        ]; (ii) the same
interpretation can have different truth values in different contexts [
        <xref ref-type="bibr" rid="ref12 ref6 ref9">9, 6, 12</xref>
        ].
      </p>
      <p>In this paper, our concern is to represent that, for the same piece
of information, different descriptions will be given, different aspects
will be highlighted, depending on the context, which can be seen as
the target the piece of information will be used for (for which
public and/or in which purpose). That is to say, different assertions will
be used to describe the same piece of information, not because of
the ambiguity of terms, nor due to the relativity of truth, but because
different aspects will be important to retain, depending on the
intention of the message vehiculated in each context. As a consequence,
the vocabulary used in each context should be appropriate. Not all
terms of the domain ontology are in accordance with the purposes
of a given context: the presence of unappropriate terms, that do not
conform to the intended use of information, can reveal a possible
diversion out of the scope of the context, and thus not be pertinent,
not understandable or not useful. For example, information intended
for general public should not be too technical, terms that translate a
judgement (positive, bad, ...) are expected in evaluation contexts, etc.</p>
      <p>The aim of this paper is to propose a way of representing
vocabularies and associating them with contexts. The examples, although
simplified, come from a real-world application in food science. The
paper is built as follows. Section 2 presents related work on
contexts and ontologies. Section 3 defines the proposed representation
of vocabularies. Section 4 proposes a mapping between contexts and
vocabularies and shows context-specific querying that ensues.
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>RELATED WORK</title>
    </sec>
    <sec id="sec-3">
      <title>Context representation</title>
      <p>
        The context model we use is based on the definition of contexts as
nesting types [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] in the conceptual graph model, which is a
knowl
      </p>
      <p>
        A way of representing contexts in this model by structuring
knowledge into levels has been descriptively introduced by [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and
furtherly studied e.g. in [
        <xref ref-type="bibr" rid="ref10 ref3">3, 10</xref>
        ]. The formalization of [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] defines a
logically founded knowledge representation formalism based on nested
graphs, thus providing operations for reasoning with nested graphs.
      </p>
      <p>
        At first level, a conceptual graph gives an overall description of
a fact. Zooming in on certain concept vertices provides more
details, also described by conceptual graphs. A conceptual graph that
is nested in a concept vertex is thus described in the context defined
by this concept. Typed nestings [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] allow specifying the relationship
(description, explanation, ...) between the surrounding vertex and one
of its descriptions. A new type set is thus added to the support, the
set of nesting types. In the following, a context is considered to be
represented as a nesting type and expresses the target (public and/or
purpose) the nested piece of information is intended for.
      </p>
      <p>An example of nested conceptual graphs, built using the concept
type set of Figure 1, is given in Figure 2. It represents the following
piece of information: “an article, whose subject is a wheat food
product that is cooked in water, has a result, whose nutritional
observation is that the vitamin content of this wheat food product decreases,
whose biochemical explanation is that this wheat food product
contains hydrosoluble vitamin that is dissolved, and whose nutritional
evaluation is that the nutritional quality of this wheat food product is
deteriorated”.</p>
      <p>The set of conceptual graphs is partially pre-ordered by the
specialization relation (noted ≤), which can be computed by the
projection operation (a graph morphism allowing the restriction of the
vertex labels). The projection is a ground operation in the
conceptual graph model since it allows the search for answers, which can be
viewed as specializations of a query (see Section 4.2).
2.2</p>
    </sec>
    <sec id="sec-4">
      <title>Ontology structure</title>
      <p>
        The question of combining different vocabularies is a major concern
of ontology integration. Several studies (e.g. [
        <xref ref-type="bibr" rid="ref5 ref7">7, 5</xref>
        ]) have proposed
distinguishing between different kinds of terminologies according to
their level of generality, the top-level being usable for large
communities of users, whereas the more specific ones are obtained by
specializing the more general levels and used for more specific needs.
      </p>
      <p>However, pertinent vocabulary, for a given use, does not always
depend on its depth in the ontology. An example is the following. To
express information intended for a general public, we can note that,
besides top-level concept types (see Figure 1), several other concept
types are pertinent because they correspond to commonly used
categories (Spaghetti, Lasagna ...), although they are more specific than
concept types that correpond to technical categories (Extruded pasta,
Laminated pasta ...) and hence cannot be used. In this example, this
is due to the fact that Spaghetti or Lasagna are appellations, they do
not explicitely express technical criteria.
3</p>
    </sec>
    <sec id="sec-5">
      <title>VOCABULARY REPRESENTATION</title>
      <p>Due to this consideration, an alternative basis to characterize
pertinent vocabulary for a given use, other than its depth in the
ontology, seems coherent to us. We propose a construction of vocabularies
based on the specialization criteria used to obtain the concept types
that compose them (appellation, technology, ...). We will firstly
define “vocabularies”, then propose two equivalent ways of
constructing them.
3.1</p>
    </sec>
    <sec id="sec-6">
      <title>Identification of elementary vocabularies</title>
      <p>Definition 1 A vocabulary is a subset of the concept type set TC . A
vocabulary V1 is more specific than V2 if V1 ⊆ V2.</p>
      <p>According to this definition, a vocabulary composed of top-level
concept types is not more general than a vocabulary composed of
more specific concept types: the two vocabularies are not
comparable. The most general vocabulary is TC , as it contains all the others.
This is in accordance with conceptual graph specialization and
projection (illustrated in Section 4.2).</p>
      <p>As mentioned in previous works (see part 2.2), in practice
ontologies are constructed by successive specializations from top to bottom
level. Moreover considering that several direct specializations of a
given concept type can have related meanings seems sensible. To
conserve these notions, we consider that vocabularies are composed
of elementary vocabularies built by successive specializations, in a
top-down way, of the concept type set.</p>
      <p>Definition 2 TC is partitioned into a set of elementary vocabularies
Vi built as follows:
- V0 is composed of the Universal concept type;
- For n &gt; 0, Vn is obtained by defining specializations of concept
types of one elementary vocabulary Vk (k &lt; n), or common
specializations of several given elementary vocabularies, through a given
specialization criterion4 (noted crt).</p>
      <p>An example is given in Figure 3 for a small part of the set of
concept types. The criterion used for each vocabulary is noted in
brackets. In this example, each elementary vocabulary is built by
specializing one preceding elementary vocabulary.</p>
      <p>Vocabularies can then be built as unions of elementary
vocabularies, obtained through specialization criteria that make sense for
a given informational purpose (see Section 4). The use of the same
specialization criterion in the definition of different elementary
vocabularies (for instance in Figure 3, vocabularies V3 and V5) can
explain why categories that are at different depths in the ontology may
be pertinent for the same uses.
3.2</p>
    </sec>
    <sec id="sec-7">
      <title>An equivalent definition</title>
      <p>The main idea being that the depth in the ontology is not so important
as the specialization criterion, we propose to formalize the notion of
criterion as a specialization of the “kind of” relation.</p>
      <p>Definition 3 A specialization of the “kind of ” relation (noted &lt;crt)
is a restriction of the “kind of ” relation obtained by specifiying the
criterion crt used to establish it.</p>
      <p>In Figure 3, 4 direct specializations of the “kind of” relation are
used to define the elementary vocabularies: “kind of, with regard to
role for humans” (noted koR), “kind of, with regard to composition”
(noted koC), “kind of, with regard to appellation” (noted koA), “kind
of, with regard to technological process” (noted koT). They could
themselves be specialized, as proposed in Figure 4.</p>
      <p>Elementary vocabularies can now be re-defined on the basis of the
specializations of the “kind of” relation (more simply called: “kind
of” relations, in the following) used to define them.
4 declaratively defined.
Definition 4 Given: (i) a set of “kind of ” relations, and (ii) a set
of concept types TC in which each pair (t, t′), where t′ is a direct
specialization of t, is associated with the “kind of ” relation used to
specialize t into t′,
an elementary vocabulary is a set of elements of TC having the same
alternation5 of “kind of ” relations on their paths from Universal.</p>
      <p>For example, in Figure 3, there is one path from Universal to
Extruded pasta, with the following “kind of” relations: koR, koC, koC,
koC, koA, koT. The alternation of “kind of” relations on this path is
thus: koR, koC, koA, koT. From Universal to Dry laminated pasta,
there are 2 paths (one through Laminated pasta and one through Dry
pasta that both have the same “kind of” relations: koR, koC, koC,
koC, koA, koT, koT. The alternation of “kind of” relations on these
paths is: koR, koC, koA, koT. As Extruded pasta and Dry laminated
pasta have the same alternation of “kind of” relations on their paths
from Universal, they belong to the same elementary vocabulary
according to Definition 4.</p>
      <p>Definitions 2 and 4 of an elementary vocabulary can be shown to
be equivalent.
4
4.1</p>
    </sec>
    <sec id="sec-8">
      <title>MAPPING CONTEXTS TO VOCABULARIES</title>
    </sec>
    <sec id="sec-9">
      <title>A mapping between contexts and vocabularies</title>
      <p>A vocabulary, built as unions of elementary vocabularies, makes
sense for a given informational purpose, corresponding to a given
context (nesting type). Hence we propose to associate a vocabulary
with each nesting type.</p>
      <p>Definition 5 Each nesting type is associated with a vocabulary
through a mapping noted υ from the set of nesting types to the set of
(non-elementary) vocabularies, satisfying: given two nesting types n
and n′, if n′ is more specific than n then υ(n′) ⊆ υ(n).</p>
      <p>For example, the general nesting type Description can be
associated with TC . The vocabulary associated with the more specific
nesting type Nutritional description excludes sanitary and
biochemical elementary vocabularies (Sanitary quality, Phytosanitary content,
Thermolabile vitamin, Hydrosoluble vitamin ...). The vocabulary
associated with Nutritional observation excludes the evaluation
elementary vocabulary (Improvement, Deterioration, Quality ...). This
is illustrated by Figure 2.
4.2</p>
    </sec>
    <sec id="sec-10">
      <title>Context-specific querying</title>
      <p>The so-called “projection” mechanism of conceptual graphs, which
is the basis of querying in that model, remains unchanged using this
5 i.e. if the same ‘kind of” relation appears several times consecutively in the
path, it is considered only once
representation of vocabularies. This is due to the fact that the
vocabulary associated with a nesting type (that appears in a query for
instance) includes the vocabulary associated with a more specific
nesting type (which can appear in an answer to this query), which avoids
having answers whose vocabulary is unknown to the query.</p>
      <p>Figure 5 gives an example of a query that expects answers (about
food products) to be in the nutritional field. The conceptual graph
of Figure 2 provides two answers, contained in the Nutritional
observation and Nutritional evaluation nestings (these types are more
specific than Nutritional description present in the query).</p>
    </sec>
    <sec id="sec-11">
      <title>CONCLUSION AND PERSPECTIVES</title>
      <p>This work has proposed two equivalent ways of defining
vocabularies, the first one based on the identification of elementary
vocabularies, the second one on specializations of the “kind of” relation. A
mapping between contexts, represented as nesting types, and
vocabularies has been proposed, which is in accordance with the querying
mechanism of the conceptual graph model.</p>
      <p>This work, emerging from user needs in an application in food
science, should evolve in several directions. A first perspective is
an extension in order to provide complementary answers during the
querying, e.g. answers from other contexts – that is, from nestings
with a non-comparable nesting type – that have compatible
vocabularies (common concept types) and that effectively only use concepts
that are allowed in the context of the query.</p>
      <p>An important issue will be to give the user the choice of the “kind
of” relations used in the querying, that can be different from one part
of a query to another, so as to allow a rich expression of needs.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Buvac</surname>
          </string-name>
          ˘, '
          <article-title>Resolving lexical ambiguity using a formal theory of context', in Semantic Ambiguity and Underspecification</article-title>
          ,
          <string-name>
            <surname>CSLI</surname>
          </string-name>
          , (
          <year>1996</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Chein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.L.</given-names>
            <surname>Mugnier</surname>
          </string-name>
          , and G. Simonet, '
          <article-title>Nested graphs: A graphbased knowledge representation model with fol semantics'</article-title>
          ,
          <source>in KR'98.</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Esch</surname>
          </string-name>
          , '
          <article-title>Contexts and concepts, abstraction duals'</article-title>
          ,
          <source>in Conceptual Structures: Current Practices</source>
          ,
          <fpage>175</fpage>
          -
          <lpage>184</lpage>
          , Springer-Verlag,
          <article-title>(</article-title>
          <year>1994</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Firat</surname>
          </string-name>
          et al.,
          <article-title>'Multi-dimensional ontology views via contexts in the ECOIN semantic interoperability framework'</article-title>
          , in
          <string-name>
            <surname>C</surname>
          </string-name>
          &amp;O-
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>N.</given-names>
            <surname>Guarino</surname>
          </string-name>
          , '
          <article-title>Formal ontology and information systems'</article-title>
          ,
          <source>in Proceedings of FOIS'98</source>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>15</lpage>
          , Trento, Italy, (
          <year>June 1998</year>
          ). IOS Press.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.V.</given-names>
            <surname>Guha</surname>
          </string-name>
          , Contexts:
          <string-name>
            <given-names>A</given-names>
            <surname>Formalization and Some Applications</surname>
          </string-name>
          ,
          <source>Ph.D. dissertation</source>
          , Stanford,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>G.</given-names>
            <surname>Van Heijst</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.T.</given-names>
            <surname>Schreiber</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.J.</given-names>
            <surname>Wielinga</surname>
          </string-name>
          , '
          <article-title>Using explicit ontologies in KBS development'</article-title>
          ,
          <source>IJHCS</source>
          ,
          <volume>46</volume>
          ,
          <fpage>183</fpage>
          -
          <lpage>292</lpage>
          , (
          <year>1997</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>De Leenheer</surname>
          </string-name>
          and A. de Moor, '
          <article-title>Context-driven disambiguation in ontology elicitation'</article-title>
          , in
          <string-name>
            <surname>C</surname>
          </string-name>
          &amp;O-
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>J. McCarthy</surname>
          </string-name>
          , '
          <source>Generality in artificial intelligence'</source>
          ,
          <source>Communication of the Association for Computing Machinery</source>
          ,
          <volume>30</volume>
          (
          <issue>12</issue>
          ),
          <fpage>1030</fpage>
          -
          <lpage>1035</lpage>
          , (
          <year>1987</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>G.</given-names>
            <surname>Mineau</surname>
          </string-name>
          and
          <string-name>
            <surname>O. Gerbe´</surname>
          </string-name>
          , '
          <article-title>Contexts: A formal definition of worlds of assertions'</article-title>
          ,
          <source>in Proceedings of ICCS'</source>
          <year>1997</year>
          , LNAI#1257, Seattle, (
          <year>1997</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.F.</given-names>
            <surname>Sowa</surname>
          </string-name>
          ,
          <source>Conceptual structures - Information processing in Mind and Machine</source>
          ,
          <string-name>
            <surname>Addison-Welsey</surname>
          </string-name>
          ,
          <year>1984</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>V.</given-names>
            <surname>Terziyan</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Puuronen</surname>
          </string-name>
          , '
          <article-title>Reasoning with multilevel contexts in semantic metanetwork'</article-title>
          , in Formal Aspects in Context, Kluwer, (
          <year>2000</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>