<!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>Towards Identity in Linked Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>James P. McCusker</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Deborah L. McGuinness</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Tetherless World Constellation Department of Computer Science Rensselaer Polytechnic Institute 110</institution>
          <addr-line>8th Street Troy, NY 12180</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Many Linked Data applications have come to rely on owl:sameAs for linking datasets. However, the current semantics for owl:sameAs assert that identity entails isomorphism, or that if a=b, then all statements of a and b are shared by both. This becomes problematic when dealing with provenance, context, and imperfect representations, all of which are endemic issues in Linked Data. Merging provenance can be problematic or even catastrophic in biomedical applications that demand access to provenance information. We use examples in biospecimen management, experimental metadata representations, and personal identity in Friend-of-a-Friend (FOAF) to demonstrate some of the problems that can arise with the use of owl:sameAs. We also show that the existence of an isomorphic owl:sameAs can be inconsistent with current expectations in a number of our use cases. We present a solution that allows the extraction of isomorphic statements without requiring their direct assertion. We also introduce a set of identity properties that can be extended for domain-speci c purposes while maintaining clarity of de nition within each property.</p>
      </abstract>
      <kwd-group>
        <kwd>owl</kwd>
        <kwd>sameAs</kwd>
        <kwd>identity</kwd>
        <kwd>linked data</kwd>
        <kwd>inferencing</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The adoption of Linked Data by many communities has resulted in a wealth of
useful data that can be combined in many ways. One current practice in Linked
Data, and therefore in many resources on the Semantic Web, is to link datasets
using owl:sameAs to de ne that two entities between those datasets are the
same. On its face, this is a good idea because a higher level best practice is to
re-use properties when possible and appropriate and owl:sameAs is a property
that seems easy to understand and is part of OWL [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], which is one of the
foundations of the semantic web and Linked Data.
      </p>
      <p>
        The property owl:sameAs is a very strict notion of identity. Its de nition
stems from that of mathematical identity, most speci cally, from the
Indiscernibility of Identicals [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], or a = b ^ p(a; x) ) p(b; x). This law is true for all true
statements about a and is the basis for isomorphism in owl:sameAs. Halpin and
Hayes [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] identify four di erent uses of owl:sameAs in Linked Data: (1) Same
Thing As But Di erent Context, (2) Same Thing As But Referentially Opaque,
(3) Represents (4) Very Similar To. They question if the use of owl:sameAs in
Linked Data is truly a harmless convention. Some have argued that since Linked
Data applications rarely use inference, one should not worry about
computational problems that would result from owl:sameAs inference. We argue that
at least some types of Linked Data applications (such as those shown in our
examples) do bene t from and actually require inference.
      </p>
      <p>We argue that one major issue with the use of owl:sameAs in Linked Data
and the Semantic Web is related to the inference of isomorphism. We present
some biomedical examples that help to describe some problems with owl:sameAs
and isomorphic inference. Finally, we discuss a set of possible identity properties
and show how the current uses outlined by Halpin and Hayes and other examples
that we describe t into the new framework.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Problems with Identity in Linked Data</title>
      <p>
        We present some examples that help to describe problems with owl:sameAs and
isomorphic inferencing. For instance, Ja ri et al. discusses a number of erroneous
mappings of owl:sameAs in DBpedia and DBLP [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Ding et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] discusses a
number of issues around combining FOAF pro les using owl:sameAs. Finally,
Jain et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] argues that more expressive semantics should be used to improve
the richness of Linked Open Data (LoD) Cloud.
      </p>
      <p>There are also issues with creating Linked Data while maintaining provenance
information. An example that we have found is in biomedical data. In Fig. 1, we
show a common derivation graph of a tumor T that was removed from a patient
A. A cell line was derived from the tumor which resulted in two specimens, LB
and LA, where LA was the original cell colony and LB was derived from it by
taking a part of LA and growing it on its own. There are datasets (D; E) that
use (LB; LA) respectively, and a scientist would like to integrate those datasets.
Through discussions with practicing scientists, we became aware of situations
where owl:sameAs is used to accomplish this. For example, the use of owl:sameAs
in Fig. 2 allows a scientist to integrate the datasets shown. However, isomorphism
is applied to all other properties of the specimens, resulting in ambiguous or
contradictory information. For instance, both specimens are inferred to have
been created on both 8/31 and 9/20, and have a quantity of both 5 and 10
grams. Also, specimen LA now seems to be derived from itself. It has been
noted that these properties could be set as annotations, which would mean that
they are not subject to isomorphism. However, most of the properties speci ed
here are rst-class data as speci ed by biospecimen management systems and
would not be considered annotations by the originating system. There are other
issues with this sort of inference. It is now very di cult to address the following
potential problems that can arise:
{ The data doesn't look right. What were the methods and protocols, and how
consistent were they, going back to surgical resection?
{ Did the \same cell line" actually come from the same tumor, or just from
the same patient? Or even di erent patients?
{ What originally seemed to be a primary breast cancer or lung cancer is now
a metastasized melanoma. How do we sort this out?
{ Is a histology slide made from a tumor the same as the tumor? What about
the tissue microarray, the cell culture, or the isolated molecular material?
None of these issues are problems that always come up, but when they do, it is
critical that the provenance of biospecimens remains distinguishable.</p>
      <p>Some have argued that these problems can be surmounted by putting the
o ending statements in a named graph, or by attaching provenance statements
as OWL 2 annotations on individuals. These solutions may work for limited
contexts, but there are issues with both. Relying on named graphs is problematic
because the statements may be embedded in other datasets which are already
enclosed in named graphs. The user would have to extract identity statements
from the original named graph and move them to another. Using annotations
would work well if the problem were limited to provenance, and provenance were
easily segregated into annotation properties. However, one data model's
provenance is another's data. Biospecimen management systems concern themselves
almost exclusively with what would be considered provenance to the
experimentalist and analyst. It must be possible to realize ex post facto that large sections
of a data model are considered to be provenance by other users. As we will
show, this problem is not con ned to provenance, but applies more generally to
statements of knowledge. Neither of these solutions address these issues.
Fig. 2. As in Fig. 1, but with the assertion owl:sameAs(LA,LB), then D and E can
be integrated because they can refer to the same specimens. However, doing so means
that there are now multiple values for some important properties and LA appears to
have been derived from itself.
3</p>
    </sec>
    <sec id="sec-3">
      <title>A Hypothesis About the use of owl:sameAs in the</title>
    </sec>
    <sec id="sec-4">
      <title>Semantic Web</title>
      <p>
        There are some additional problems with using the indiscernibility of identicals
in knowledge representation discussed by Saul [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. While the question of exactly
what knowledge is is an ongoing philosophical problem [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ], it is generally
agreed upon that for an entity to know a statement, it must rst believe that
statement to be true. This of course doesn't imply that the statement is true.
False beliefs are not by any means rare. Because of this, a number of issues that
apply to belief also apply to epistemology and knowledge representation. Since
the semantic web is concerned with knowledge and not truth values [10{12], these
issues also apply to the semantic web. Below, we discuss some problems described
by Kripke [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], Saul [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], and Pitt [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], but convert beliefs into assertions, which
are more applicable to a semantic web context. One classic problem concerns
secret identities:
1. Lois Lane claims Superman can y.
2. Lois Lane claims Clark Kent cannot y.
3. Superman and Clark Kent are the same person.
      </p>
      <p>We can then infer that Lois Lane claims that Superman cannot y, and that
Clark Kent can. These statements in combination with the assertions generate
contradictions. Similar problems arise even without belief statements:
4. Clark Kent is Superman's secret identity.
5. Therefore, Superman is Superman's secret identity.</p>
      <p>This is nonsensical, as a secret identity must be di erent from a public identity.
This is also true of changes in identity over time:
6. I never made it to Constantinople, but I visited Istanbul last week.
7. Istanbul was Constantinople.
8. I never made it to Istanbul, but I visited Istanbul last week.</p>
      <p>
        These examples all violate Leibniz's law regarding the identity of indiscernibles
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] in various ways, showing that even things that seem identical may not be
so. Another possibility is that a person's knowledge of X is not an inherent
predicate of X. This is important to the semantic web since, as we discussed
before, all statements made in the semantic web are statements of knowledge,
not statements of truth. Thus, it can be problematic to use owl:sameAs (with
its isomorphic character) in all knowledge representation scenarios.
4
      </p>
      <p>A New</p>
    </sec>
    <sec id="sec-5">
      <title>Model for Identity in the Semantic Web</title>
      <p>
        The examples above indicate a need for an identity (or similar) notion that is
not inherently isomorphic. We also have a need to be able to nd all entities
that are inferred (or stated) to be identical to a designated entity. The modeling
we need to do that is driven by these and other use cases, lead us to desire
more options related to the concept of identity. As mentioned above, Halpin and
Hayes [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] have identi ed four usages of owl:sameAs in Linked Data and we have
identi ed several more. We review owl:sameAs and decompose its properties into
Transitivity, Symmetry, and Re exivity. We then discuss di erent permutations
of those properties and show how current usages of owl:sameAs ts into the new
framework. Finally, we will show how isomorphism can be selectively enabled
for particular properties using property annotations.
4.1
      </p>
      <sec id="sec-5-1">
        <title>The Identity Ontology</title>
        <p>The property owl:sameAs is, in addition to being isomorphic, Transitive,
Symmetric, and Re exive. Each permutation of those meta-properties can be viewed
as a new kind of identity. We have de ned a new ontology called the Identity
Ontology (IO).1 The properties of the IO are shown in Table 1. Domain-speci c
properties can be created as sub-properties of one of the eight IO properties
in order to maximize interoperability while maintaining distinctions among
future concepts of identity. We have also de ned a mapping ontology that shows
examples of mappings with existing identity properties from RDFS, OWL, and
SKOS2 and show the subproperty relationship among the new and existing
identity properties in Fig. 3.</p>
        <sec id="sec-5-1-1">
          <title>1 http://purl.org/twc/ontologies/identity.owl</title>
        </sec>
        <sec id="sec-5-1-2">
          <title>2 http://purl.org/twc/ontologies/identity-mapping.owl</title>
          <p>
            id:identical This is the most restrictive property of identity in IO. It follows the
same de nition as owl:sameAs, which \indicates" that two URI references
actually refer to the same thing: the individuals have the same `identity'."
[
            <xref ref-type="bibr" rid="ref1">1</xref>
            ] As this is the most restrictive property, no IO identity properties are
subproperties of it. owl:sameAs is de ned to be a subproperty so that existing
valid assertions of identity are preserved.
          </p>
          <p>
            The usages \Same Thing As But Di erent Context" and \Same Thing As But
Referentially Opaque" from Halpin and Hayes [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] t neatly into id:identical.
\Same Thing As But Referentially Opaque" is e ectively supported directly
by use of id:identical, and \Same Thing But Di erent Context" can be served
by implementation of a subproperty to aid in distinction. The examples using
Superman and Clark Kent can be considered to be in either class, and would
be served equally well. The example using Istanbul3 should be considered to
be \Same Thing But Di erent Context", as the contextual distinction is the
existence of the Ottoman Empire. The FOAF examples also would bene t from
use of id:identical.
id:claimsIdentical Since this property is Transitive and Re exive, but not
          </p>
          <p>Symmetric, it serves as a way for one entity to claim the identity of another,</p>
        </sec>
        <sec id="sec-5-1-3">
          <title>3 Not Constantinople.</title>
          <p>
            without the inverse needing to be true. As a super property of id:identical,
everything that is actually identical makes the claim of identity, with both
sides of the claim being made due to the symmetry of id:identical. This
property is transitive because if entity a claims to be entity b and b claims
to be entity c, then a cannot deny that it is claiming to be c as well.
The usage \Represents" can be supported using id:claimsIdentical using a
subproperty \representedBy". Since id:claimsIdentical suggests that a can be
replaced by b if claimsIdentical(a; b), then it can be said that b represents a, or
to t into our usage more clearly, representedBy(a; b).
id:matches This property is re exive and symmetric. It is inspired by
skos:exactMatch, which \indicates a high degree of con dence that two concepts can
be used interchangeably across a wide range of information retrieval
applications." [
            <xref ref-type="bibr" rid="ref15">15</xref>
            ] id:matches is a super property of id:identical, because for all
things that are identical, they also match.
          </p>
          <p>
            For extremely strong assertions of \Very Similar To" from Halpin and Hayes
[
            <xref ref-type="bibr" rid="ref3">3</xref>
            ], id:matches can be used to assert identity because id:matches is
intransitive. Many current identities in Linked Data would be well supported using this
property.
id:claimsMatches This is the same as id:matches, but is not symmetric, so
that entities can claim that they match things without reciprocation.
Weaker assertions of \Represents" can be supported using this method. It is
also useful for representing the relationship between a particular biospecimen
and the cell line that that represents it.
id:similar This is a statement of similarity without a guarantee of a complete
match. Similarity is both Symmetric and Re exive. Since things that match
each other are also similar to each other, id:similar is a super property of
id:matches. This is a super property of id:identical since everything that is
identical is also similar. It is also a super property of skos:closeMatch [
            <xref ref-type="bibr" rid="ref15">15</xref>
            ].
This property can be best used to describe the fact that two biospecimens are
part of the same cell line. A notional subproperty, such as sameCellLineAs, would
allow for a domain-speci c distinction of similarity that is understandable to
domain experts while still providing usefulness to more general-purpose systems.
Depending on the strength of \very" in \Very Similar To", it can also support
the concept of identity for that usage from Halpin and Hayes [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ].
id:claimsSimilar This is the same as id:claims but is not symmetric.
Entities can therefore use this property to claim similarity without
reciprocation. A statement of similarity is in actuality two claims of similarity,
so id:claimsSimilar is a super property of id:similar. In symmetry with
id:similar, claims of identity and matching imply a claim of similarity.
This property is best seen in cases of asymmetric substitutions. For instance,
decongestant can be substituted by an antihistamine (and can be said to be
similar to it), but when someone has allergies, a decongestant will not relieve
the symptoms. Another example is that, in a pinch, one can use conditioner in
lieu of shaving cream, but the reverse does not hold.
id:related This asserts an associative link between two entities. As it is only
symmetric, there are no claims to any sort of similarity, matching, or identity.
Because of this, id:related is a super property of only id:matches, as id:similar
and id:identical are re exive, which would make id:related re exive by proxy.
          </p>
          <p>
            This property is closely related to and is a super property of skos:related [
            <xref ref-type="bibr" rid="ref15">15</xref>
            ].
The idea of related entities is currently used in SKOS and in OBO (Open
Biomedical Ontologies).4
id:claimsRelated This is the loosest sense of identity in IO. It is a similar
property to rdfs:seeAlso, which is \used to indicate a resource that might
provide additional information about the subject resource." [
            <xref ref-type="bibr" rid="ref16">16</xref>
            ] We
dene rdfs:seeAlso to be a sub property of id:claimsRelated. id:related and
id:claimsMatches are both super properties of id:claimsRelated.
          </p>
          <p>An example subproperty of id:claimsRelated is a depiction. Since a photograph
or a illustration of a person or thing is not the thing itself, but a representation
of the thing, this is a kind of identity that is not symmetric (the photograph is
not depicted by the person), not transitive (a depiction of the depiction may not
depict the original subject), and not re exive (does a person depict themselves?).</p>
          <p>These properties cover the wide range of identity relationships from \a is the
same thing as b" to \b has more information about a" and allow the expression of
precise concepts of identity while also leaving room for domain-speci c concepts
as well.
4.2</p>
        </sec>
      </sec>
      <sec id="sec-5-2">
        <title>Reconstructing Isomorphism</title>
        <p>For any re exive statement of identity, it is possible to recover isomorphic
statements using the following SPARQL query snippet:
select ?s, ?p, ?o
where {
?s id:identical ?x.</p>
        <p>
          ?x ?p ?o.
}
A major bene t of this formulation is that any property can be used in place
of id:identical and can be used for domain-speci c concepts of identity.
Additionally, property chains in OWL 2 [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] allow the de nition of isomorphism for
        </p>
        <sec id="sec-5-2-1">
          <title>4 http://obofoundries.org</title>
          <p>speci c properties where that behavior is warranted. The speci c pattern would
be:</p>
          <p>SubObjectP ropertyOf (ObjectP ropertyChain(identical; p); p)
It is therefore possible to construct properties that are isomorphic across speci c
concepts of identity and allows users to query for values for any other
property that would have been isomorphic if the identity had been asserted using
owl:sameAs.
5</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Discussion</title>
      <p>
        We and others [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] have recognized the growing usage of OWL constructs such as
owl:sameAs. However, we also have observed unanticipated usages of owl:sameAs
where the existing semantics do not match the epistemological modeling needs.
This has led us to develop the Identity Ontology. We believe that IO provides
additional representational options for the notions of identity shown in our
examples. We intend to continue our line of research into identifying, describing, and
using these di erent representational options. It is interesting to note that the
use cases are satis ed through application of existing OWL patterns of property
types and property chaining.
      </p>
      <p>The Identity Ontology is a starting point for developing a more nuanced
approach to identity in the semantic web. IO addresses numerous challenges in
our biomedical examples, and we have begun to use IO to represent concepts
of identity in biomedical datasets. Speci cally, we integrated two experiments
from Array Express: E-TABM-65 and E-MEXP-1029. Both of these experiments
use the NCI-60, a panel of cell lines used for cancer research. We converted
the two experiments to RDF using MAGETAB2RDF5 and aligned the
biological sources using biomedidentity:sameAsBioSource.6 In that ontology, we also
make mage:has derivative,7 and mged:has biomaterial characteristics 8
isomorphic across our identity property using property chains. We plan to continue to
investigate the properties of identity in relation to constructs included in IO as
well as owl:sameAs.
6</p>
    </sec>
    <sec id="sec-7">
      <title>Conclusions</title>
      <p>We have elaborated on problems with isomorphism in the current use of
owl:sameAs in Linked Data on the Semantic Web. We have provided more options for
representing identity using our Identity Ontology and have initial work
supporting its usage in a number of use cases. We also show how isomorphic statements
can be queried, and how particular properties can be made to be isomorphic
using property chains in OWL 2. We have also successfully used the Identity</p>
      <sec id="sec-7-1">
        <title>5 http://magetab2rdf.googlecode.com</title>
      </sec>
      <sec id="sec-7-2">
        <title>6 http://espresso.med.yale.edu/ jpm78/tw/identity/biomedidentity.owl</title>
      </sec>
      <sec id="sec-7-3">
        <title>7 http://magetab2rdf.googlecode.com/svn/trunk/ontologies/mage-om.owl</title>
      </sec>
      <sec id="sec-7-4">
        <title>8 http://mged.sourceforge.net/ontologies/MGEDOntology.owl</title>
        <p>Ontology to enable more granular control over inference. We have found that
this additional control over inferred information is a better match to our
biomedical application needs than what we previously had access to using owl:sameAs
alone.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bechhofer</surname>
          </string-name>
          , S., van
          <string-name>
            <surname>Harmelen</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hendler</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McGuinness</surname>
            ,
            <given-names>D.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>PatelSchneider</surname>
            ,
            <given-names>P.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>L.A.: OWL</given-names>
          </string-name>
          <string-name>
            <surname>Web Ontology Language Reference</surname>
          </string-name>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Leibniz</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Loemker</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Philosophical papers and letters</article-title>
          . Springer (
          <year>1976</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Halpin</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hayes</surname>
            ,
            <given-names>P.J.:</given-names>
          </string-name>
          <article-title>When owl:sameAs isn't the Same: An Analysis of Identity Links on the Semantic Web</article-title>
          .
          <source>In: Workshop on Linked Data on the Web (LDOW)</source>
          .
          <article-title>(</article-title>
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Ja</surname>
            <given-names>ri</given-names>
          </string-name>
          , A.,
          <string-name>
            <surname>Glaser</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Millard</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>URI Disambiguation in the Context of Linked Data</article-title>
          .
          <source>In: Workshop on Linked Data on the Web (LDOW)</source>
          .
          <article-title>(</article-title>
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shinavier</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finin</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McGuinness</surname>
            ,
            <given-names>D.L.:</given-names>
          </string-name>
          <article-title>An Empirical Study of owl:sameAs Use in Linked Data</article-title>
          .
          <source>In: Web Science</source>
          <year>2010</year>
          . (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Jain</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hitzler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yeh</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verma</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sheth</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Linked Data Is Merely More Data</article-title>
          . Dan Brickley,
          <string-name>
            <surname>Vinay K. Chaudhri</surname>
          </string-name>
          , Harry Halpin, and
          <article-title>Deborah McGuinness: Linked Data Meets Arti cial Intelligence</article-title>
          .
          <source>Technical Report SS-10-07</source>
          (
          <year>2010</year>
          )
          <volume>82</volume>
          {
          <fpage>86</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Saul</surname>
          </string-name>
          , J.:
          <article-title>Substitution and simple sentences</article-title>
          .
          <source>Analysis</source>
          <volume>57</volume>
          (
          <issue>2</issue>
          ) (
          <year>1997</year>
          )
          <fpage>102</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Armstrong</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Belief, truth and knowledge</article-title>
          . Cambridge University Press London (
          <year>1973</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Gettier</surname>
          </string-name>
          , E.: Is justi ed true
          <source>belief knowledge? Analysis</source>
          <volume>23</volume>
          (
          <issue>6</issue>
          ) (
          <year>1963</year>
          )
          <fpage>121</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hendler</surname>
          </string-name>
          , J.:
          <article-title>Scienti c publishing on the semantic web</article-title>
          .
          <source>Nature</source>
          <volume>410</volume>
          (
          <year>2001</year>
          )
          <volume>1023</volume>
          {
          <fpage>1024</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. He in, J.:
          <article-title>Towards the semantic web: knowledge representation in a dynamic, distributed environment</article-title>
          .
          <source>PhD thesis</source>
          , University of Maryland, College Park (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Davies</surname>
          </string-name>
          , J., van
          <string-name>
            <surname>Harmelen</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fensel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Towards the semantic web: ontologydriven knowledge management</article-title>
          . John Wiley &amp; Sons, Inc. New York, NY, USA (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Kripke</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>A puzzle about belief</article-title>
          .
          <source>Meaning and Use</source>
          (
          <year>1979</year>
          )
          <volume>239</volume>
          {
          <fpage>283</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Pitt</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          : Alter Egos and
          <string-name>
            <given-names>Their</given-names>
            <surname>Names</surname>
          </string-name>
          .
          <source>The Journal of Philosophy</source>
          <volume>98</volume>
          (
          <issue>10</issue>
          ) (
          <year>2001</year>
          )
          <volume>531</volume>
          {
          <fpage>552</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Miles</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bechhofer</surname>
            ,
            <given-names>S.: SKOS</given-names>
          </string-name>
          <string-name>
            <surname>Simple Knowledge Organization System Reference</surname>
          </string-name>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Brickley</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guha</surname>
            ,
            <given-names>R.V.</given-names>
          </string-name>
          :
          <source>RDF Vocabulary Description Language 1</source>
          .0:
          <string-name>
            <given-names>RDF</given-names>
            <surname>Schema</surname>
          </string-name>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Motik</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patel-Schneider</surname>
            ,
            <given-names>P.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuenca Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          : OWL 2
          <string-name>
            <given-names>Web</given-names>
            <surname>Ontology Language: Direct Semantics</surname>
          </string-name>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>