<?xml version='1.0'?>
<!DOCTYPE art SYSTEM 'http://www.biomedcentral.com/xml/article.dtd'>
<art>
   <ui>1471-2105-8-377</ui>
   <ji>1471-2105</ji>
   <fm>
      <dochead>Methodology article</dochead>
      <bibl>
         <title>
            <p>Representing default knowledge in biomedical ontologies: application to the integration of anatomy and phenotype ontologies</p>
         </title>
         <aug>
            <au id="A1" ca="yes">
               <snm>Hoehndorf</snm>
               <fnm>Robert</fnm>
               <insr iid="I1"/>
               <insr iid="I2"/>
               <insr iid="I3"/>
               <email>hoehndorf@eva.mpg.de</email>
            </au>
            <au id="A2">
               <snm>Loebe</snm>
               <fnm>Frank</fnm>
               <insr iid="I2"/>
               <insr iid="I3"/>
               <email>loebe@informatik.uni-leipzig.de</email>
            </au>
            <au id="A3">
               <snm>Kelso</snm>
               <fnm>Janet</fnm>
               <insr iid="I1"/>
               <email>kelso@eva.mpg.de</email>
            </au>
            <au id="A4">
               <snm>Herre</snm>
               <fnm>Heinrich</fnm>
               <insr iid="I2"/>
               <insr iid="I3"/>
               <email>heinrich.herre@imise.uni-leipzig.de</email>
            </au>
         </aug>
         <insg>
            <ins id="I1">
               <p>Department of Evolutionary Genetics, Max Planck Institute for Evolutionary Anthropology, Deutscher Platz 6, 04103 Leipzig, Germany</p>
            </ins>
            <ins id="I2">
               <p>Institute of Medical Informatics, Statistics and Epidemiology (IMISE), University of Leipzig, H&#228;rtelstra&#223;e 16-18, 04107 Leipzig, Germany</p>
            </ins>
            <ins id="I3">
               <p>Institute for Informatics, University of Leipzig, Johannisgasse 26, 04103 Leipzig, Germany</p>
            </ins>
         </insg>
         <source>BMC Bioinformatics</source>
         <issn>1471-2105</issn>
         <pubdate>2007</pubdate>
         <volume>8</volume>
         <issue>1</issue>
         <fpage>377</fpage>
         <url>http://www.biomedcentral.com/1471-2105/8/377</url>
         <xrefbib>
            <pubidlist>
               <pubid idtype="pmpid">17925014</pubid>
               <pubid idtype="doi">10.1186/1471-2105-8-377</pubid>
            </pubidlist>
         </xrefbib>
      </bibl>
      <history>
         <rec>
            <date>
               <day>22</day>
               <month>5</month>
               <year>2007</year>
            </date>
         </rec>
         <acc>
            <date>
               <day>09</day>
               <month>10</month>
               <year>2007</year>
            </date>
         </acc>
         <pub>
            <date>
               <day>09</day>
               <month>10</month>
               <year>2007</year>
            </date>
         </pub>
      </history>
      <cpyrt>
         <year>2007</year>
         <collab>Hoehndorf et al; licensee BioMed Central Ltd.</collab>
         <note>This is an Open Access article distributed under the terms of the Creative Commons Attribution License (<url>http://creativecommons.org/licenses/by/2.0</url>), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</note>
      </cpyrt>
      <abs>
         <sec>
            <st>
               <p>Abstract</p>
            </st>
            <sec>
               <st>
                  <p>Background</p>
               </st>
               <p>Current efforts within the biomedical ontology community focus on achieving interoperability between various biomedical ontologies that cover a range of diverse domains. Achieving this interoperability will contribute to the creation of a rich knowledge base that can be used for querying, as well as generating and testing novel hypotheses. The OBO Foundry principles, as applied to a number of biomedical ontologies, are designed to facilitate this interoperability. However, semantic extensions are required to meet the OBO Foundry interoperability goals. Inconsistencies may arise when ontologies of properties &#8211; mostly phenotype ontologies &#8211; are combined with ontologies taking a canonical view of a domain &#8211; such as many anatomical ontologies. Currently, there is no support for a correct and consistent integration of such ontologies.</p>
            </sec>
            <sec>
               <st>
                  <p>Results</p>
               </st>
               <p>We have developed a methodology for accurately representing canonical domain ontologies within the OBO Foundry. This is achieved by adding an extension to the semantics for relationships in the biomedical ontologies that allows for treating canonical information as default. Conclusions drawn from default knowledge may be revoked when additional information becomes available. We show how this extension can be used to achieve interoperability between ontologies, and further allows for the inclusion of more knowledge within them. We apply the formalism to ontologies of mouse anatomy and mammalian phenotypes in order to demonstrate the approach.</p>
            </sec>
            <sec>
               <st>
                  <p>Conclusion</p>
               </st>
               <p>Biomedical ontologies require a new class of relations that can be used in conjunction with default knowledge, thereby extending those currently in use. The inclusion of default knowledge is necessary in order to ensure interoperability between ontologies.</p>
            </sec>
         </sec>
      </abs>
   </fm>
   <bdy>
      <sec>
         <st>
            <p>Background</p>
         </st>
         <p>As the volume of biomedical data and knowledge presented in scientific papers increases, there is an increasing need to support formal analyses of these data and to pre-process knowledge for further use in solving problems and developing and testing hypotheses. The precise capture of biological data and knowledge and their correct and consistent representation in computational form is a basic pre-requisite for achieving these goals. Ontologies may provide a basis for integrating, processing and applying biomedical data. Their integration into a common ontological framework is an indispensible step towards the development of expressive knowledge bases. Interoperability between these ontologies would facilitate the consistent use of biomedical data in the form of annotations, allow for queries over multiple ontologies and form a rich knowledge resource for biomedicine that could be further used in solving problems and stating hypotheses. Different ontologies have been developed by different groups with different intentions. As a result, translating a statement or transferring an annotation from one ontology to another may not always yield the correct results. The absence of clear principles for achieving interoperability between different ontologies hinders the development of advanced applications and analysis tools based on these ontologies. A number of biomedical ontologies exist, which cover domains such as anatomy <abbrgrp><abbr bid="B1">1</abbr></abbrgrp>, cell structure, biological processes, functions <abbrgrp><abbr bid="B2">2</abbr></abbrgrp>, diseases <abbrgrp><abbr bid="B3">3</abbr></abbrgrp>, development <abbrgrp><abbr bid="B4">4</abbr></abbrgrp>, experimental conditions, phenotypes, qualities <abbrgrp><abbr bid="B5">5</abbr></abbrgrp> and relationships <abbrgrp><abbr bid="B6">6</abbr></abbrgrp>. A subset of these are unified under the umbrella of the Open Biomedical Ontologies (OBO) Foundry <abbrgrp><abbr bid="B7">7</abbr></abbrgrp>. The OBO Relationship Ontology <abbrgrp><abbr bid="B6">6</abbr></abbrgrp>, together with the principles set forth in the OBO Foundry <abbrgrp><abbr bid="B8">8</abbr></abbrgrp> have contributed to better interoperability between a large number of these ontologies. We address here several remaining problems.</p>
         <p>One particular difficulty in making these ontologies interoperable results from the existence of two particular types of biomedical ontologies. The first group describes a <it>canonical </it>or idealized view on a domain, such as an ontology of canonical anatomy. The other group describes <it>phenotypes</it>, properties or phenomena, that &#8211; when exemplified by individuals &#8211; may contradict knowledge represented in the first group. We call the former group <it>canonical ontologies </it>and the latter <it>phenotype ontologies</it>. An example of a canonical ontology is the Foundational Model of Anatomy <abbrgrp><abbr bid="B9">9</abbr></abbrgrp> (FMA), which describes an idealized domain, i.e., it describes a prototypical, idealized human anatomy. Many ontologies describing structure, such as cell structure, histology or anatomy, are canonical in this sense. On the other hand, a phenotype ontology describes phenomena whose exemplification by individuals may lead to deviations from this idealized structure. For example, the Mammalian Phenotype Ontology <abbrgrp><abbr bid="B10">10</abbr></abbrgrp> contains the term "absent tail" as a specific type of "abnormal tail morphology". When a researcher would like to refer to an individual mouse with an "absent tail", this mouse does not comply with the canonical, idealized mouse anatomy that excludes such abnormalities.</p>
         <p>The integration of ontologies of these different types cannot be achieved using methods developed hitherto, and a new set of methods transcending the framework of classical logic must be introduced to avoid inconsistencies while preserving the specificity of both types of knowledge. We present an approach that uses nonmonotonic reasoning to integrate canonical and phenotype ontologies.</p>
      </sec>
      <sec>
         <st>
            <p>Methods and Results</p>
         </st>
         <sec>
            <st>
               <p>GFO-Bio</p>
            </st>
            <p>Integrating ontologies is a powerful means for achieving interoperability. We adopt John Sowa's definition of ontology integration [<abbrgrp><abbr bid="B11">11</abbr></abbrgrp>, p. 494], which he characterized as the process of finding commonalities between different ontologies <it>A </it>and <it>B </it>and deriving a new, integrated ontology <it>C </it>that facilitates interoperability between information systems based on ontologies <it>A </it>and <it>B</it>. There are several approaches to achieving such an integration <abbrgrp><abbr bid="B12">12</abbr></abbrgrp>, but there is no generally accepted solution.</p>
            <p>Our approach to integration is based on top-level ontologies <abbrgrp><abbr bid="B13">13</abbr></abbrgrp>. For our study, we use the top-level ontology General Formal Ontology (GFO) <abbrgrp><abbr bid="B14">14</abbr></abbrgrp>. GFO has several features that distinguish it from other top-level ontologies such as BFO <abbrgrp><abbr bid="B15">15</abbr><abbr bid="B16">16</abbr></abbrgrp> and DOLCE <abbrgrp><abbr bid="B17">17</abbr></abbrgrp>. Among the relevant features are the inclusion of a theory of levels of reality <abbrgrp><abbr bid="B18">18</abbr></abbrgrp>, and the explicit incorporation of an ontological theory of higher-order categories (see figure <figr fid="F1">1</figr> for an overview of selected categories and an explanation of higher-order categories). We have developed GFO-Bio <abbrgrp><abbr bid="B19">19</abbr></abbrgrp>, a core ontology <abbrgrp><abbr bid="B20">20</abbr></abbrgrp> for biology. It is formalized in the Web Ontology Language <abbrgrp><abbr bid="B21">21</abbr></abbrgrp> (OWL) and includes aspects of faceted classification <abbrgrp><abbr bid="B22">22</abbr></abbrgrp> combined with GFO's theory of ontological levels of reality <abbrgrp><abbr bid="B18">18</abbr></abbrgrp>.</p>
            <fig id="F1">
               <title>
                  <p>Figure 1</p>
               </title>
               <caption>
                  <p>The main categories of the General Formal Ontology (GFO) as outlined in [14, p. 70]</p>
               </caption>
               <text>
                  <p>The main categories of the General Formal Ontology (GFO) as outlined in [14, p. 70]. The basic distinction of GFO relevant for this work relates to items and is between individuals and categories. Individuals are items that cannot be instantiated. Categories are items that can have instances and may be predicated of other entities. The instances of categories of first order are individuals, while higher-order categories have categories as instances. For all items, the <b>instance-of </b>relationship is a relation of major importance, linking items (including categories) to the categories of which they are an instance.</p>
               </text>
               <graphic file="1471-2105-8-377-1"/>
            </fig>
            <p>GFO-Bio comprises an ontology of individuals, similar to other established upper biomedical ontologies. "Biological individual" is introduced as a subclass of GFO's "Individual" category. The classes are defined or restricted using description logic statements. For example, a "Molecule" is a subclass of "Material object", which has as part at least two atoms. In addition, GFO-Bio contains another branch, in which categories themselves are further described and defined. This is an ontology of categories within the biomedical domain. It is this part of GFO-Bio that can directly represent directed acyclic graphs, which are commonly used for many biomedical ontologies. For an overview of the modules of GFO-Bio, see figure <figr fid="F2">2</figr>. In the remainder of this section, the basic ontology used can be considered to contain only two categories, "Individual" and "Category". We prefix relationships between categories with <it>CC </it>and relationships between individuals with <it>II</it>. Relationships between categories and individuals are prefixed with <it>CI </it>or <it>IC </it>respectively. For example, the relationship <b>IC-instance-of </b>is the instantiation relation, and the relation <b>CC-isa </b>is the is-a relation.</p>
            <fig id="F2">
               <title>
                  <p>Figure 2</p>
               </title>
               <caption>
                  <p>The modules of the biological core ontology GFO-Bio</p>
               </caption>
               <text>
                  <p>The modules of the biological core ontology GFO-Bio. GFO-Bio comes in two modules. The first focuses on individuals and defines categories of individuals like "Cell" or "Organism" in the Web Ontology Language (OWL). It contains 168 categories and 73 relations. The second treats categories as instances in OWL and describes interrelations between domains or whole domain ontologies. It is based on a theory of levels of reality and contains 43 categories and two additional relations. Both modules are related using the Semantic Web Rule Language [44] and DLVHEX rules.</p>
               </text>
               <graphic file="1471-2105-8-377-2"/>
            </fig>
         </sec>
         <sec>
            <st>
               <p>Default rules and default logic</p>
            </st>
            <p>Using GFO-Bio as a framework for integrating biomedical ontologies, we address the problem of accurately representing canonical and phenotype ontologies. A canonical anatomy ontology such as the Foundational Model of Anatomy <abbrgrp><abbr bid="B9">9</abbr></abbrgrp> (FMA) establishes rules such as:</p>
            <p>
               <display-formula id="M1">Every instance of a human body has as part an appendix.</display-formula>
            </p>
            <p>This does not necessarily apply to every real human body: an individual human body may <it>lack </it>an appendix as part. However, the rule describes an idealized or <it>canonical </it>human. Phenotype ontologies describe phenomena, whose exemplification by individuals can be <it>deviations </it>from these idealizations. For example, an individual may be both an instance of a prototypical human body as described in the FMA (which implies an appendix as part) and an instance of the category "human body with absent appendix". In a classical logical framework, such as those commonly used in biomedical knowledge representation, e.g. in the form of OWL <abbrgrp><abbr bid="B21">21</abbr></abbrgrp>, a formalization of the conjunction of these two statements would lead to an inconsistency. A human body in the former case has an appendix as a part, while in the latter case it does not. Instantiating both categories creates the inconsistency. A logical inconsistency in the formal sense can only arise when the logical functor of negation is used. This functor is hidden in concepts such as "absent X", as used in the Mammalian Phenotype Ontology <abbrgrp><abbr bid="B10">10</abbr></abbrgrp>. The formal detection of logical inconsistencies by inferences needs an explication of negation.</p>
            <p>In order to avoid terms such as "absent X" and make the negation explicit, we adopt a modified form of the <b>lacks </b>relation <abbrgrp><abbr bid="B23">23</abbr></abbrgrp>, which we explicitly define as:</p>
            <p>Individual <it>p </it><b>lacks </b>category <it>C </it>with respect to relation <b>R</b>, if and only if there does not exist an <it>x </it>such that: <it>p</it><b>R</b><it>x </it>and <it>x </it>is an instance of <it>C</it>.</p>
            <p>We use binary relations of the kind <it>x </it><b>lacks-R </b><it>C </it>instead of <it>x </it><b>lacks </b><it>C </it>with respect to <b>R</b>. For example, the fact that some individual <it>x </it><b>lacks </b>a category <it>C </it>with respect to the relation <b>has-part </b>will be denoted as <it>x </it><b>lacks-part </b><it>C</it>.</p>
            <p>Using the <b>lacks </b>relation may cause an inconsistency when a canonical ontology and a corresponding phenotype ontology are used in a classical logic formalism, such as first order logic <abbrgrp><abbr bid="B24">24</abbr></abbrgrp> or description logic <abbrgrp><abbr bid="B25">25</abbr></abbrgrp>. The reason is that classical formalisms enforce very strict interpretations, e.g. of quantifications like "every human", which results in <it>monotonicity </it>of these formalisms: the inferences drawn from a classical logical theory <it>T </it>remain true in every extension of <it>T </it>with additional facts.</p>
            <p>In order to prevent inconsistencies, while at the same time preserving the intuition behind statements such as "a human has an appendix as part", the interpretation of such statements in the canonical ontology must be modified. We propose to use a <it>nonmonotonic </it>logic that treats the statements provided in a canonical ontology as true by default. Adding further knowledge, e.g. by referring to a phenotype ontology or using a statement involving the <b>lacks </b>relation (and therefore negation), may invalidate previously drawn conclusions.</p>
            <p>Several ways of treating default rules and exceptions in logics have been proposed. The most popular among these proposals are default logic <abbrgrp><abbr bid="B26">26</abbr></abbrgrp>, circumscription <abbrgrp><abbr bid="B27">27</abbr><abbr bid="B28">28</abbr></abbrgrp> and autoepistemic logic <abbrgrp><abbr bid="B29">29</abbr><abbr bid="B30">30</abbr></abbrgrp>. We use default logic for our application, because it admits a transparent representation, and allows a semantically correct translation to a form of nonmonotonic, declarative logic programs called answer set programs <abbrgrp><abbr bid="B31">31</abbr></abbrgrp>.</p>
            <p>In default logic, a <it>default rule </it>has the following form:</p>
            <p>
               <display-formula id="M2">
                  <m:math name="1471-2105-8-377-i1" xmlns:m="http://www.w3.org/1998/Math/MathML">
                     <m:semantics>
                        <m:mrow>
                           <m:mfrac>
                              <m:mrow>
                                 <m:mi>A</m:mi>
                                 <m:mo stretchy="false">(</m:mo>
                                 <m:mover accent="true">
                                    <m:mi>x</m:mi>
                                    <m:mo>&#175;</m:mo>
                                 </m:mover>
                                 <m:mo stretchy="false">)</m:mo>
                                 <m:mo>:</m:mo>
                                 <m:mi>B</m:mi>
                                 <m:mo stretchy="false">(</m:mo>
                                 <m:mover accent="true">
                                    <m:mi>x</m:mi>
                                    <m:mo>&#175;</m:mo>
                                 </m:mover>
                                 <m:mo stretchy="false">)</m:mo>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>C</m:mi>
                                 <m:mo stretchy="false">(</m:mo>
                                 <m:mover accent="true">
                                    <m:mi>x</m:mi>
                                    <m:mo>&#175;</m:mo>
                                 </m:mover>
                                 <m:mo stretchy="false">)</m:mo>
                              </m:mrow>
                           </m:mfrac>
                        </m:mrow>
                        <m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaWcaaqaaiabdgeabjabcIcaOiqbdIha4zaaraGaeiykaKIaeiOoaOJaemOqaiKaeiikaGIafmiEaGNbaebacqGGPaqkaeaacqWGdbWqcqGGOaakcuWG4baEgaqeaiabcMcaPaaaaaa@3AA8@</m:annotation>
                     </m:semantics>
                  </m:math>
               </display-formula>
            </p>
            <p>This means that if <it>A</it>(<inline-formula><m:math name="1471-2105-8-377-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mover accent="true"><m:mi>x</m:mi><m:mo>&#175;</m:mo></m:mover><m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaqeaaaa@2E3D@</m:annotation></m:semantics></m:math></inline-formula>) is true (prerequisite), and <it>it is consistent to assume </it>that <it>B</it>(<inline-formula><m:math name="1471-2105-8-377-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mover accent="true"><m:mi>x</m:mi><m:mo>&#175;</m:mo></m:mover><m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaqeaaaa@2E3D@</m:annotation></m:semantics></m:math></inline-formula>), then <it>C</it>(<inline-formula><m:math name="1471-2105-8-377-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mover accent="true"><m:mi>x</m:mi><m:mo>&#175;</m:mo></m:mover><m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaqeaaaa@2E3D@</m:annotation></m:semantics></m:math></inline-formula>) can be derived. Intuitively, <it>A</it>(<inline-formula><m:math name="1471-2105-8-377-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mover accent="true"><m:mi>x</m:mi><m:mo>&#175;</m:mo></m:mover><m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaqeaaaa@2E3D@</m:annotation></m:semantics></m:math></inline-formula>) is a prerequisite, and assuming <it>B</it>(<inline-formula><m:math name="1471-2105-8-377-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mover accent="true"><m:mi>x</m:mi><m:mo>&#175;</m:mo></m:mover><m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaqeaaaa@2E3D@</m:annotation></m:semantics></m:math></inline-formula>) adds justification for deriving <it>C</it>(<inline-formula><m:math name="1471-2105-8-377-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mover accent="true"><m:mi>x</m:mi><m:mo>&#175;</m:mo></m:mover><m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaqeaaaa@2E3D@</m:annotation></m:semantics></m:math></inline-formula>) from <it>A</it>(<inline-formula><m:math name="1471-2105-8-377-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mover accent="true"><m:mi>x</m:mi><m:mo>&#175;</m:mo></m:mover><m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaqeaaaa@2E3D@</m:annotation></m:semantics></m:math></inline-formula>). Thus, as long as <it>B</it>(<inline-formula><m:math name="1471-2105-8-377-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mover accent="true"><m:mi>x</m:mi><m:mo>&#175;</m:mo></m:mover><m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaqeaaaa@2E3D@</m:annotation></m:semantics></m:math></inline-formula>) can be assumed, default logic concludes <it>C</it>(<inline-formula><m:math name="1471-2105-8-377-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mover accent="true"><m:mi>x</m:mi><m:mo>&#175;</m:mo></m:mover><m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaqeaaaa@2E3D@</m:annotation></m:semantics></m:math></inline-formula>). In order to formalize our example of humans normally having an appendix as part, we would use the following default rule:</p>
            <p>
               <display-formula id="M3">
                  <m:math name="1471-2105-8-377-i3" xmlns:m="http://www.w3.org/1998/Math/MathML">
                     <m:semantics>
                        <m:mrow>
                           <m:mfrac>
                              <m:mrow>
                                 <m:mi>H</m:mi>
                                 <m:mi>u</m:mi>
                                 <m:mi>m</m:mi>
                                 <m:mi>a</m:mi>
                                 <m:mi>n</m:mi>
                                 <m:mo stretchy="false">(</m:mo>
                                 <m:mi>x</m:mi>
                                 <m:mo stretchy="false">)</m:mo>
                                 <m:mo>:</m:mo>
                                 <m:mi>x</m:mi>
                                 <m:mtext>&#160;</m:mtext>
                                 <m:mi>I</m:mi>
                                 <m:mi>C</m:mi>
                                 <m:mtext>-</m:mtext>
                                 <m:mi>h</m:mi>
                                 <m:mi>a</m:mi>
                                 <m:mi>s</m:mi>
                                 <m:mtext>-</m:mtext>
                                 <m:mi>p</m:mi>
                                 <m:mi>a</m:mi>
                                 <m:mi>r</m:mi>
                                 <m:mi>t</m:mi>
                                 <m:mtext>&#160;</m:mtext>
                                 <m:mi>A</m:mi>
                                 <m:mi>p</m:mi>
                                 <m:mi>p</m:mi>
                                 <m:mi>e</m:mi>
                                 <m:mi>n</m:mi>
                                 <m:mi>d</m:mi>
                                 <m:mi>i</m:mi>
                                 <m:mi>x</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>x</m:mi>
                                 <m:mtext>&#160;</m:mtext>
                                 <m:mi>I</m:mi>
                                 <m:mi>C</m:mi>
                                 <m:mtext>-</m:mtext>
                                 <m:mi>h</m:mi>
                                 <m:mi>a</m:mi>
                                 <m:mi>s</m:mi>
                                 <m:mtext>-</m:mtext>
                                 <m:mi>p</m:mi>
                                 <m:mi>a</m:mi>
                                 <m:mi>r</m:mi>
                                 <m:mi>t</m:mi>
                                 <m:mtext>&#160;</m:mtext>
                                 <m:mi>A</m:mi>
                                 <m:mi>p</m:mi>
                                 <m:mi>p</m:mi>
                                 <m:mi>e</m:mi>
                                 <m:mi>n</m:mi>
                                 <m:mi>d</m:mi>
                                 <m:mi>i</m:mi>
                                 <m:mi>x</m:mi>
                              </m:mrow>
                           </m:mfrac>
                        </m:mrow>
                        <m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaWcaaqaaiabdIeaijabdwha1jabd2gaTjabdggaHjabd6gaUjabcIcaOiabdIha4jabcMcaPiabcQda6iabdIha4jabbccaGGqabiab=Leajjab=neadjabb2caTiab=HgaOjab=fgaHjab=nhaZjabb2caTiab=bhaWjab=fgaHjab=jhaYjab=rha0jabbccaGiabdgeabjabdchaWjabdchaWjabdwgaLjabd6gaUjabdsgaKjabdMgaPjabdIha4bqaaiabdIha4jabbccaGiab=Leajjab=neadjabb2caTiab=HgaOjab=fgaHjab=nhaZjabb2caTiab=bhaWjab=fgaHjab=jhaYjab=rha0jabbccaGiabdgeabjabdchaWjabdchaWjabdwgaLjabd6gaUjabdsgaKjabdMgaPjabdIha4baaaaa@6DE8@</m:annotation>
                     </m:semantics>
                  </m:math>
               </display-formula>
            </p>
            <p>Here, the precondition is <it>Human</it>(<it>x</it>), the fact that <it>x </it>is a human. Then, if it is consistent to assume that <it>x </it>has as part an instance of <it>Appendix</it>, it is concluded that <it>x </it>has as part an instance of <it>Appendix</it>. The definition of the relation <b>IC-has-part </b>follows the schema in table <tblr tid="T1">1</tblr>.</p>
            <tbl id="T1">
               <title>
                  <p>Table 1</p>
               </title>
               <caption>
                  <p>Schema of introduced relations</p>
               </caption>
               <tblbdy cols="3">
                  <r>
                     <c ca="left">
                        <p>
                           <b>Relation</b>
                        </p>
                     </c>
                     <c ca="left">
                        <p>
                           <b>Domain:Range</b>
                        </p>
                     </c>
                     <c ca="left">
                        <p>
                           <b>Definition</b>
                        </p>
                     </c>
                  </r>
                  <r>
                     <c cspan="3">
                        <hr/>
                     </c>
                  </r>
                  <r>
                     <c ca="left">
                        <p>
                           <it>x </it>
                           <b>II-R </b>
                           <it>y</it>
                        </p>
                     </c>
                     <c ca="left">
                        <p>Individual:Individual</p>
                     </c>
                     <c ca="left">
                        <p>The individuals <it>x </it>and <it>y </it>stand in the relationship <b>II-R</b>.</p>
                     </c>
                  </r>
                  <r>
                     <c ca="left">
                        <p>
                           <it>x </it>
                           <b>IC-R </b>
                           <it>y</it>
                        </p>
                     </c>
                     <c ca="left">
                        <p>Individual:Category</p>
                     </c>
                     <c ca="left">
                        <p>There exists an individual <it>z</it>, such that: <it>z </it><b>IC-instance-of </b><it>y </it>and <it>x </it><b>II-R </b><it>z</it>.</p>
                     </c>
                  </r>
                  <r>
                     <c ca="left">
                        <p>
                           <it>x </it>
                           <b>CC-R </b>
                           <it>y</it>
                        </p>
                     </c>
                     <c ca="left">
                        <p>Category:Category</p>
                     </c>
                     <c ca="left">
                        <p>For all individuals <it>a </it>such that: <it>a </it><b>IC-instance-of </b><it>x</it>, <it>a </it><b>IC-R </b><it>y</it>.</p>
                     </c>
                  </r>
                  <r>
                     <c ca="left">
                        <p>
                           <it>x </it>
                           <b>CC-canonical-R </b>
                           <it>y</it>
                        </p>
                     </c>
                     <c ca="left">
                        <p>Category:Category</p>
                     </c>
                     <c ca="left">
                        <p>For all individuals <it>a </it>such that: <it>a </it><b>IC-instance-of </b><it>x</it>, by default, <it>a </it><b>IC-R </b><it>y</it>.</p>
                     </c>
                  </r>
                  <r>
                     <c ca="left">
                        <p>
                           <it>x </it>
                           <b>II-lacks-R </b>
                           <it>y</it>
                        </p>
                     </c>
                     <c ca="left">
                        <p>Individual:Individual</p>
                     </c>
                     <c ca="left">
                        <p>The individuals <it>x </it>and <it>y </it>do not stand in the relationship <b>II-R</b>.</p>
                     </c>
                  </r>
                  <r>
                     <c ca="left">
                        <p>
                           <it>x </it>
                           <b>IC-lacks-R </b>
                           <it>y</it>
                        </p>
                     </c>
                     <c ca="left">
                        <p>Individual:Category</p>
                     </c>
                     <c ca="left">
                        <p>The individual <it>x </it>does not stand in the relationship <b>IC-R </b>to <it>y</it>.</p>
                     </c>
                  </r>
                  <r>
                     <c ca="left">
                        <p>
                           <it>x </it>
                           <b>CC-lacks-R </b>
                           <it>y</it>
                        </p>
                     </c>
                     <c ca="left">
                        <p>Category:Category</p>
                     </c>
                     <c ca="left">
                        <p>For all individuals <it>a </it>such that: <it>a </it><b>IC-instance-of </b><it>x</it>, <it>a </it><b>IC-lacks-R </b><it>y</it>.</p>
                     </c>
                  </r>
               </tblbdy>
               <tblfn>
                  <p>For each relation used in a biomedical ontology, a number of relations between categories, individuals and between individuals and categories can be created. The <b>CC-canonical-R </b>relationship is a <it>default </it>relation that is accompanied by axioms in an answer set program to describe its semantics as a default.</p>
               </tblfn>
            </tbl>
            <p>Nonmonotonicity arises from "it is consistent to assume that <it>x </it><b>IC-has-part </b><it>Appendix</it>", which means that if <it>x </it><b>IC-has-part </b><it>Appendix </it>cannot be proven false from the given facts, its addition to the knowledge base does not lead to a contradiction. Adding the statement that <it>x </it>does not have an appendix as part (<it>x </it><b>IC-lacks-part </b><it>Appendix</it>) would lead to an inconsistency with <it>x </it><b>IC-has-part </b><it>Appendix</it>; therefore, this rule could no longer be used to derive that <it>x </it>has an appendix as part.</p>
            <p>Answer-set programming, the formalism we use for our implementation, can mimic default rules. It uses two kinds of negation, called <it>strong </it>and <it>weak negation</it>. Strong negation is the classical (monotonic) negation, as used in the definition of the <b>lacks </b>relation. Weak negation, often denoted as not A, corresponds to the above statements "it cannot be proven that A is true", or "it is consistent to assume that A is false".</p>
         </sec>
         <sec>
            <st>
               <p>Formalizing defaults in biomedical ontologies</p>
            </st>
            <p>In a canonical ontology, relationships between its categories can be interpreted as <it>default </it>relations. By default, a human has some appendix as part. However, an instance of a human, such as <it>John</it>, may <b>lack </b>an appendix as a part; therefore, <it>John </it>is an instance of both "human" and "human without an appendix" (or "absent appendix"). In order to include canonical relationships between two categories, new relations must be introduced, such as <b>CC-canonical-has-part</b>. Then, the relationship between "human" and "appendix" becomes "human <b>CC-canonical-has-part </b>appendix". Further, this relationship corresponds to a <it>default rule</it>:</p>
            <p>
               <display-formula id="M4">
                  <m:math name="1471-2105-8-377-i4" xmlns:m="http://www.w3.org/1998/Math/MathML">
                     <m:semantics>
                        <m:mrow>
                           <m:mtable columnalign="left">
                              <m:mtr columnalign="left">
                                 <m:mtd columnalign="left">
                                    <m:mrow>
                                       <m:mtext>forall&#160;</m:mtext>
                                       <m:mi>x</m:mi>
                                       <m:mo>,</m:mo>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>1</m:mn>
                                       </m:msub>
                                       <m:mo>,</m:mo>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>2</m:mn>
                                       </m:msub>
                                       <m:mo>:</m:mo>
                                    </m:mrow>
                                 </m:mtd>
                              </m:mtr>
                              <m:mtr columnalign="left">
                                 <m:mtd columnalign="left">
                                    <m:mrow>
                                       <m:mtext/>
                                       <m:mtext>if&#160;</m:mtext>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>1</m:mn>
                                       </m:msub>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:mi>C</m:mi>
                                       <m:mi>C</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>c</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>o</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>i</m:mi>
                                       <m:mi>c</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>l</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>h</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>s</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>p</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>r</m:mi>
                                       <m:mi>t</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>2</m:mn>
                                       </m:msub>
                                       <m:mtext>&#160;and&#160;</m:mtext>
                                       <m:mi>x</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:mi>I</m:mi>
                                       <m:mi>C</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>i</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>s</m:mi>
                                       <m:mi>t</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>c</m:mi>
                                       <m:mi>e</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>o</m:mi>
                                       <m:mi>f</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>1</m:mn>
                                       </m:msub>
                                       <m:mo>,</m:mo>
                                       <m:mtext>then</m:mtext>
                                    </m:mrow>
                                 </m:mtd>
                              </m:mtr>
                              <m:mtr columnalign="left">
                                 <m:mtd columnalign="left">
                                    <m:mrow>
                                       <m:mtext/>
                                       <m:mtext>by&#160;default</m:mtext>
                                       <m:mo>:</m:mo>
                                    </m:mrow>
                                 </m:mtd>
                              </m:mtr>
                              <m:mtr columnalign="left">
                                 <m:mtd columnalign="left">
                                    <m:mrow>
                                       <m:mtext/>
                                       <m:mtext>there&#160;exists&#160;a&#160;</m:mtext>
                                       <m:mi>y</m:mi>
                                       <m:mo>:</m:mo>
                                       <m:mi>y</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:mi>I</m:mi>
                                       <m:mi>C</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>i</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>s</m:mi>
                                       <m:mi>t</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>c</m:mi>
                                       <m:mi>e</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>o</m:mi>
                                       <m:mi>f</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>2</m:mn>
                                       </m:msub>
                                       <m:mtext>&#160;and&#160;</m:mtext>
                                       <m:mi>x</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:mi>I</m:mi>
                                       <m:mi>I</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>h</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>s</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>p</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>r</m:mi>
                                       <m:mi>t</m:mi>
                                       <m:mi/>
                                       <m:mi>y</m:mi>
                                    </m:mrow>
                                 </m:mtd>
                              </m:mtr>
                           </m:mtable>
                        </m:mrow>
                        <m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeGabqacbuaabaqaeeaaaaqaaiabbAgaMjabb+gaVjabbkhaYjabbggaHjabbYgaSjabbYgaSjabbccaGiabdIha4jabcYcaSiabdoeadnaaBaaaleaacqaIXaqmaeqaaOGaeiilaWIaem4qam0aaSbaaSqaaiabikdaYaqabaGccqGG6aGoaeGacmaDbmasdiaaxMaacqqGPbqAcqqGMbGzcqqGGaaicqWGdbWqdaWgaaWcbaGaeGymaedabeaakiabbccaGGqabiab=neadjab=neadjabb2caTiab=ngaJjab=fgaHjab=5gaUjab=9gaVjab=5gaUjab=LgaPjab=ngaJjab=fgaHjab=XgaSjabb2caTiab=HgaOjab=fgaHjab=nhaZjabb2caTiab=bhaWjab=fgaHjab=jhaYjab=rha0jabbccaGiabdoeadnaaBaaaleaacqaIYaGmaeqaaOGaeeiiaaIaeeyyaeMaeeOBa4MaeeizaqMaeeiiaaIaemiEaGNaeeiiaaIae8xsaKKae83qamKaeeyla0Iae8xAaKMae8NBa4Mae83CamNae8hDaqNae8xyaeMae8NBa4Mae83yamMae8xzauMaeeyla0Iae83Ba8Mae8NzayMaeeiiaaIaem4qam0aaSbaaSqaaiabigdaXaqabaGccqGGSaalcqqG0baDcqqGObaAcqqGLbqzcqqGUbGBaeGafiafhiauhia+hiadjiasjiaaxMaacqqGIbGycqqG5bqEcqqGGaaicqqGKbazcqqGLbqzcqqGMbGzcqqGHbqycqqG1bqDcqqGSbaBcqqG0baDcqGG6aGoaeGabqaJbiaaxMaacqqG0baDcqqGObaAcqqGLbqzcqqGYbGCcqqGLbqzcqqGGaaicqqGLbqzcqqG4baEcqqGPbqAcqqGZbWCcqqG0baDcqqGZbWCcqqGGaaicqqGHbqycqqGGaaicqWG5bqEcqGG6aGocqWG5bqEcqqGGaaicqWFjbqscqWFdbWqcqqGTaqlcqWFPbqAcqWFUbGBcqWFZbWCcqWF0baDcqWFHbqycqWFUbGBcqWFJbWycqWFLbqzcqqGTaqlcqWFVbWBcqWFMbGzcqqGGaaicqWGdbWqdaWgaaWcbaGaeGOmaidabeaakiabbccaGiabbggaHjabb6gaUjabbsgaKjabbccaGiabdIha4jabbccaGiab=Leajjab=Leajjabb2caTiab=HgaOjab=fgaHjab=nhaZjabb2caTiab=bhaWjab=fgaHjab=jhaYjab=rha0jab=bcaGGqaciab+Lha5baaaaa@DB4F@</m:annotation>
                     </m:semantics>
                  </m:math>
               </display-formula>
            </p>
            <p>Using a class of <b>lacks </b>relationships as introduced by <abbrgrp><abbr bid="B23">23</abbr></abbrgrp>, we formalize the default operator in the rule above as:</p>
            <p>
               <display-formula id="M5">
                  <m:math name="1471-2105-8-377-i5" xmlns:m="http://www.w3.org/1998/Math/MathML">
                     <m:semantics>
                        <m:mrow>
                           <m:mtable columnalign="left">
                              <m:mtr columnalign="left">
                                 <m:mtd columnalign="left">
                                    <m:mrow>
                                       <m:mtext>forall&#160;</m:mtext>
                                       <m:mi>x</m:mi>
                                       <m:mo>,</m:mo>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>1</m:mn>
                                       </m:msub>
                                       <m:mo>,</m:mo>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>2</m:mn>
                                       </m:msub>
                                       <m:mo>:</m:mo>
                                    </m:mrow>
                                 </m:mtd>
                              </m:mtr>
                              <m:mtr columnalign="left">
                                 <m:mtd columnalign="left">
                                    <m:mrow>
                                       <m:mtext/>
                                       <m:mtext>if&#160;</m:mtext>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>1</m:mn>
                                       </m:msub>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:mi>C</m:mi>
                                       <m:mi>C</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>c</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>o</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>i</m:mi>
                                       <m:mi>c</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>l</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>h</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>s</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>p</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>r</m:mi>
                                       <m:mi>t</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>2</m:mn>
                                       </m:msub>
                                       <m:mtext>&#160;and&#160;</m:mtext>
                                       <m:mi>x</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:mi>I</m:mi>
                                       <m:mi>C</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>i</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>s</m:mi>
                                       <m:mi>t</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>c</m:mi>
                                       <m:mi>e</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>o</m:mi>
                                       <m:mi>f</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>1</m:mn>
                                       </m:msub>
                                       <m:mtext>&#160;and</m:mtext>
                                    </m:mrow>
                                 </m:mtd>
                              </m:mtr>
                              <m:mtr columnalign="left">
                                 <m:mtd columnalign="left">
                                    <m:mrow>
                                       <m:mtext/>
                                       <m:mtext>it&#160;cannot&#160;be&#160;proven&#160;that&#160;</m:mtext>
                                       <m:mi>x</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:mi>I</m:mi>
                                       <m:mi>C</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>l</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>c</m:mi>
                                       <m:mi>k</m:mi>
                                       <m:mi>s</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>p</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>r</m:mi>
                                       <m:mi>t</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>2</m:mn>
                                       </m:msub>
                                       <m:mo>,</m:mo>
                                       <m:mtext>then</m:mtext>
                                    </m:mrow>
                                 </m:mtd>
                              </m:mtr>
                              <m:mtr columnalign="left">
                                 <m:mtd columnalign="left">
                                    <m:mrow>
                                       <m:mtext/>
                                       <m:mtext>there&#160;exists&#160;a&#160;</m:mtext>
                                       <m:mi>y</m:mi>
                                       <m:mo>:</m:mo>
                                       <m:mi>y</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:mi>I</m:mi>
                                       <m:mi>C</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>i</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>s</m:mi>
                                       <m:mi>t</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>n</m:mi>
                                       <m:mi>c</m:mi>
                                       <m:mi>e</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>o</m:mi>
                                       <m:mi>f</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:msub>
                                          <m:mi>C</m:mi>
                                          <m:mn>2</m:mn>
                                       </m:msub>
                                       <m:mtext>&#160;and&#160;</m:mtext>
                                       <m:mi>x</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:mi>I</m:mi>
                                       <m:mi>I</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>h</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>s</m:mi>
                                       <m:mtext>-</m:mtext>
                                       <m:mi>p</m:mi>
                                       <m:mi>a</m:mi>
                                       <m:mi>r</m:mi>
                                       <m:mi>t</m:mi>
                                       <m:mtext>&#160;</m:mtext>
                                       <m:mi>y</m:mi>
                                    </m:mrow>
                                 </m:mtd>
                              </m:mtr>
                           </m:mtable>
                        </m:mrow>
                        <m:annotation encoding="MathType-MTEF">
 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaafaqaaeabbaaaaeaacqqGMbGzcqqGVbWBcqqGYbGCcqqGHbqycqqGSbaBcqqGSbaBcqqGGaaicqWG4baEcqGGSaalcqWGdbWqdaWgaaWcbaGaeGymaedabeaakiabcYcaSiabdoeadnaaBaaaleaacqaIYaGmaeqaaOGaeiOoaOdabiqaaayacaWLjaGaeeyAaKMaeeOzayMaeeiiaaIaem4qam0aaSbaaSqaaiabigdaXaqabaGccqqGGaaiieqacqWFdbWqcqWFdbWqcqqGTaqlcqWFJbWycqWFHbqycqWFUbGBcqWFVbWBcqWFUbGBcqWFPbqAcqWFJbWycqWFHbqycqWFSbaBcqqGTaqlcqWFObaAcqWFHbqycqWFZbWCcqqGTaqlcqWFWbaCcqWFHbqycqWFYbGCcqWF0baDcqqGGaaicqWGdbWqdaWgaaWcbaGaeGOmaidabeaakiabbccaGiabbggaHjabb6gaUjabbsgaKjabbccaGiabdIha4jabbccaGiab=Leajjab=neadjabb2caTiab=LgaPjab=5gaUjab=nhaZjab=rha0jab=fgaHjab=5gaUjab=ngaJjab=vgaLjabb2caTiab=9gaVjab=zgaMjabbccaGiabdoeadnaaBaaaleaacqaIXaqmaeqaaOGaeeiiaaIaeeyyaeMaeeOBa4MaeeizaqgabiqaaGOacaWLjaGaeeyAaKMaeeiDaqNaeeiiaaIaee4yamMaeeyyaeMaeeOBa4MaeeOBa4Maee4Ba8MaeeiDaqNaeeiiaaIaeeOyaiMaeeyzauMaeeiiaaIaeeiCaaNaeeOCaiNaee4Ba8MaeeODayNaeeyzauMaeeOBa4MaeeiiaaIaeeiDaqNaeeiAaGMaeeyyaeMaeeiDaqNaeeiiaaIaemiEaGNaeeiiaaIae8xsaKKae83qamKaeeyla0Iae8hBaWMae8xyaeMae83yamMae83AaSMae83CamNaeeyla0Iae8hCaaNae8xyaeMae8NCaiNae8hDaqNaeeiiaaIaem4qam0aaSbaaSqaaiabikdaYaqabaGccqGGSaalcqqG0baDcqqGObaAcqqGLbqzcqqGUbGBaeGabaaPbiaaxMaacqqG0baDcqqGObaAcqqGLbqzcqqGYbGCcqqGLbqzcqqGGaaicqqGLbqzcqqG4baEcqqGPbqAcqqGZbWCcqqG0baDcqqGZbWCcqqGGaaicqqGHbqycqqGGaaicqWG5bqEcqGG6aGocqWG5bqEcqqGGaaicqWFjbqscqWFdbWqcqqGTaqlcqWFPbqAcqWFUbGBcqWFZbWCcqWF0baDcqWFHbqycqWFUbGBcqWFJbWycqWFLbqzcqqGTaqlcqWFVbWBcqWFMbGzcqqGGaaicqWGdbWqdaWgaaWcbaGaeGOmaidabeaakiabbccaGiabbggaHjabb6gaUjabbsgaKjabbccaGiabdIha4jabbccaGiab=Leajjab=Leajjabb2caTiab=HgaOjab=fgaHjab=nhaZjabb2caTiab=bhaWjab=fgaHjab=jhaYjab=rha0jabbccaGiabdMha5baaaaa@051A@</m:annotation>
                     </m:semantics>
                  </m:math>
               </display-formula>
            </p>
            <p>In general, for each relation <b>R </b>between the categories in an ontology, we create several new relations: <b>CC-R </b>for the monotonic relationship between the categories, <b>CC-canonical-R </b>for the nonmonotonic default relationship between categories, <b>IC-R </b>for the monotonic relationship between an individual and a category, such as "John <b>IC-has-part </b>Appendix", meaning that John has some appendix as part, and <b>II-R </b>for the monotonic relationship between individuals. In addition, we introduce a class of <b>lacks </b>relationships. A schematic view of the new relationships introduced is shown in table <tblr tid="T1">1</tblr>. The schema is somewhat incomplete, because the introduction of canonical relations can be extended to the class of <b>lacks </b>relation, in the sense that some category may canonically lack some other category with respect to a relation <b>R</b>. In this case, the relation <b>R </b>must be replaced by <b>lacks-R</b>. This allows the treatment of exceptions between categories. For example, the category "Mouse with absent tail" can be defined as a mouse which lacks a tail as part.</p>
         </sec>
         <sec>
            <st>
               <p>Implementation</p>
            </st>
            <p>We have used a technique known as DL-programs <abbrgrp><abbr bid="B32">32</abbr></abbrgrp> to implement rules together with the OWL version of GFO-Bio. The system DLVHEX allows for a bidirectional flow of information between an answer-set program and a description logic knowledge base or ontology; thus, it is well suited for our purposes. DLVHEX is based on the well-established datalog system DLV <abbrgrp><abbr bid="B33">33</abbr></abbrgrp>.</p>
            <p>Relationships that are used in GFO-Bio are made available in the DLVHEX system. It then becomes possible to express the necessary axioms for relations of the kind <b>CC-canonical-R</b>. For example, for the relationship <b>CC-canonical-has-part</b>, the following axiom is added, corresponding to formula (5) in DLVHEX:</p>
            <p>
               <monospace>IC-has-part(X,Y) :- ind(X),class(Y),class(Z),inst(X,Z),</monospace>
            </p>
            <p>
               <monospace>&#160;&#160;&#160;CC-canonical-has-part(Z,Y),</monospace>
            </p>
            <p>
               <monospace>&#160;&#160;&#160;not IC-lacks-part(X,Y).</monospace>
            </p>
            <p>This means that if two categories <it>Z </it>and <it>Y </it>stand in the relation <b>CC-canonical-has-part</b>, and <it>it cannot be proven that X </it><b>IC-lacks-part </b><it>Y </it>(not IC-lacksPart(X,Y)), then it is concluded that an individual <it>X</it>, which is an instance of <it>Z</it>, stands in the relation <b>IC-has-part </b>to the category <it>Y</it>. A simple example illustrating this reasoning is shown in figure <figr fid="F3">3</figr>.</p>
            <fig id="F3">
               <title>
                  <p>Figure 3</p>
               </title>
               <caption>
                  <p>In figure (a), the left side shows five individuals (instances of GFO-Bio's "Individual" category) and the right side contains four categories (instances of GFO-Bio's "Category" category)</p>
               </caption>
               <text>
                  <p>In figure (a), the left side shows five individuals (instances of GFO-Bio's "Individual" category) and the right side contains four categories (instances of GFO-Bio's "Category" category). In addition, a number of relations are illustrated between the individuals, between the categories, and between individuals and categories. The relation <b>R</b>, denoted as <b>II-R</b>, is transitive. Figure (a) and the transitivity of <b>II-R </b>should be seen as the input ontology. In figure (b), the result of a classification using a description logic reasoner is illustrated. Here, the transitivity of the <b>CC-isa </b>relation and the relation <b>II-R </b>is resolved, reflected by the additional links. Figure (c) shows the result from applying the answer set rules formulated in DLVHEX. In this step, the default relationship between two categories, denoted by <b>CC-canonical-R</b>, is resolved. Two additional <b>IC-R </b>links are created for one individual. For the other individual, which instantiates the same category, these links are not created, because the <b>IC-lacks-R </b>relation blocks them.</p>
               </text>
               <graphic file="1471-2105-8-377-3"/>
            </fig>
            <p>A plot showing the performance of our implementation for a common type of query on a mid-sized ontology is shown in figure <figr fid="F4">4</figr>. The sample test indicates that queries can be answered, but require several minutes. While this may be insufficient in practice for some applications, we believe that it shows that our implementation works, but needs further improvement. An extensive performance evaluation of the proposed method after some improvements on the implementation is subject to future work.</p>
            <fig id="F4">
               <title>
                  <p>Figure 4</p>
               </title>
               <caption>
                  <p>This test uses the Adult Mouse Anatomy Ontology with 2740 classes</p>
               </caption>
               <text>
                  <p>This test uses the Adult Mouse Anatomy Ontology with 2740 classes. For testing, a fixed number of instances of <it>Adult mouse </it>is generated for a single run. Moreover, each of the mouse instances is assigned a single exception by means of a <b>lacks-part </b><it>tail </it>statement. Using this dataset, a query for all parts of each mouse is run, which yields 2729 parts per mouse (derived from applicable canonical relationships). As intended, tails are not contained, and neither are any parts of tail like <it>caudal vertebra</it>. The graph shows the number of seconds for test runs with 0 to 80 mouse instances. For some numbers of instances, the time consumption is considerably less than for others. The difference of over 300 seconds is caused by the answer set solver DLV. We have been unable to examine the source code in order to determine the reason for this behaviour. The dataset used for this test can be accessed from the project webpage [45].</p>
               </text>
               <graphic file="1471-2105-8-377-4"/>
            </fig>
         </sec>
         <sec>
            <st>
               <p>Ontology integration with GFO-Bio</p>
            </st>
            <p>Integrating biological ontologies using GFO-Bio involves several steps. First, an OWL-DL version of each ontology must be aquired or produced. OWL-DL is a sufficiently expressive language because negation is available and logical inconsistencies can be formally detected in the OWL-DL framework. For the purpose of this conversion, we provide a tool <abbrgrp><abbr bid="B19">19</abbr></abbrgrp> that converts OBO format files <abbrgrp><abbr bid="B34">34</abbr></abbrgrp> into OWL-DL. This conversion yields correct results for ontologies that are built according to the OBO Foundry principles, but may provide incorrect conversions for other ontologies available in the OBO format. The generated OWL-DL file must then be imported by GFO-Bio. Each top-level class of the imported ontology is then defined, at least partially, using categories from GFO-Bio's individual tree. For example, the "Cell" category of the Celltype Ontology <abbrgrp><abbr bid="B35">35</abbr></abbrgrp> must be declared a subclass of (or an equivalent of) GFO-Bio's "Cell" category. Further, a second OWL-DL file can be produced for each integrated ontology containing the ontology's categories as instances of GFO-Bio's category branch. We also provide a tool for performing this conversion for OBO files. This file must be imported by GFO-Bio as well. In this file, relationships between categories, as directly expressed in the OBO-style directed acyclic graphs (DAGs), are modelled as relationships between OWL instances.</p>
            <p>For example, the relationship expressed in the DAG of the Gene Ontology's cellular component ontology, "Membrane <b>part-of </b>Cell", is represented twice in GFO-Bio: First, "Membrane" and "Cell" are created as classes in OWL, and the following restriction created (in line with <abbrgrp><abbr bid="B36">36</abbr></abbrgrp>):</p>
            <p>
               <monospace>SubClassOf(Membrane restriction(II-part-of someValuesFrom(Cell)))</monospace>
            </p>
            <p>
               <monospace>In addition, the Gene Ontology's "Cell" category is declared equivalent to GFO-Bio's "Cell" category. Second, "Membrane" and "Cell" are treated as instances of GFO-Bio's "Category" class, and a relation <b>CC-part-of </b>('CC' indicating the category-category reading of the relation) between "Membrane" and "Cell" is asserted:</monospace>
            </p>
            <p>
               <monospace>Individual(Membrane value(CC-part-of Cell))</monospace>
            </p>
            <p>While neither the first nor the second step alone require more than the description logic fragment of OWL, in conjunction they result in an OWL-Full <abbrgrp><abbr bid="B21">21</abbr></abbrgrp> ontology.</p>
            <p>For an adequate integration of canonical and phenotype ontologies, nonmonotonically treated formulas must be added. This requires the addition of an answer set program for each relation <b>CC-canonical-R </b>and the corresponding relations <b>IC-R </b>and <b>IC-lacks-R</b>:</p>
            <p>
               <monospace>IC-R(X,Y) :- ind(X),class(Y),class(Z),inst(X,Z),</monospace>
            </p>
            <p>
               <monospace>&#160;&#160;&#160;CC-canonical-R(Z,Y),</monospace>
            </p>
            <p>
               <monospace>&#160;&#160;&#160;not IC-lacks-R(X,Y).</monospace>
            </p>
         </sec>
         <sec>
            <st>
               <p>Additions to the OBO Relationship Ontology</p>
            </st>
            <p>The OBO Relationship Ontology <abbrgrp><abbr bid="B6">6</abbr></abbrgrp> requires several additions for our proposal to succeed. First, the classes of <b>lacks </b>relations, as described in table <tblr tid="T1">1</tblr>, must be added. This will allow lacking body parts to be defined in ontologies such as the Mammalian Phenotype Ontology <abbrgrp><abbr bid="B10">10</abbr></abbrgrp>.</p>
            <p>In the description logic variant of the Web Ontology Language <abbrgrp><abbr bid="B21">21</abbr><abbr bid="B25">25</abbr></abbrgrp> (OWL-DL), <b>lacks </b>relations can be expressed using negated statements. However, <b>lacks </b>relations are reduced to relations between individuals in a different way compared to what is done for most other relations in the OBO Relationship Ontology (cf. table <tblr tid="T1">1</tblr>). Ontologies developed directly in OWL-DL could use negation to avoid reference to <b>lacks </b>relations at all.</p>
            <p>Second, <b>canonical-R </b>relations must be included as relations between categories, using the semantics introduced here. In particular, the <b>canonical-R </b>relations require a nonmonotonic knowledge representation formalism, and cannot be formalized using any form of classical logic. We presented one possible implementation using answer set semantics, but there are other alternatives. At its core, however, the definition of the <b>canonical-R </b>relations remains the same in all possible formalisms dealing with defaults: <it>if it is consistent to assume that </it>some relation holds, this relation holds.</p>
         </sec>
         <sec>
            <st>
               <p>Use case: Integration of Mouse Anatomy and Mammalian Phenotype Ontology</p>
            </st>
            <p>The method we propose can be used in conjunction with existing tools and ontologies. Little effort is required to modify current ontologies to fit within our proposed methodology. Below, we demonstrate how to re-interpret the Adult Mouse Anatomy Ontology <abbrgrp><abbr bid="B1">1</abbr></abbrgrp> (MA) and the Mammalian Phenotype Ontology <abbrgrp><abbr bid="B10">10</abbr></abbrgrp> (MP) to fit within our proposed framework, and discuss problems with the current formalization in the MP.</p>
            <sec>
               <st>
                  <p>Mouse Anatomy</p>
               </st>
               <p>The Adult Mouse Anatomy Ontology (MA) uses two relationships, <b>is-a </b>and <b>part-of</b>. We introduce one new relationship to the MA, which we call <b>canonical-has-part</b>, and automatically <it>add </it>for each statement of the type</p>
               <p>
                  <monospace><it>X </it><b>part-of </b><it>Y </it>(6)</monospace>
               </p>
               <p>
                  <monospace>the new statement</monospace>
               </p>
               <p>
                  <monospace><it>Y </it><b>canonical-has-part </b><it>X</it>. (7)</monospace>
               </p>
               <p>We believe that this will result in most cases in correctly interpreted default rules, but this method will generate some inadequate statements. Therefore, manual verification will be necessary. In addition, some of the generated statements may not contain default rules, but are universally true, while some of the currently present statements involving <b>part-of </b>may not be universally true, but represent default rules. Therefore, automatically generating default rules from existing statements can only be the first step, and in the continued development of the MA, a distinction must be made between default rules and universally true statements. This may make it necessary to include additional relationships between categories in the MA, e.g. <b>canonical-part-of </b>and <b>has-part</b>.</p>
            </sec>
            <sec>
               <st>
                  <p>Mammalian Phenotype Ontology</p>
               </st>
               <p>The Mammalian Phenotype Ontology (MP) defines, among others, categories labelled by terms such as <it>absent-X</it>. In these terms, the hidden negation must be made explicit. The MP is available in two versions, one containing only <b>is-a </b>relations, and another experimental version that attempts to define terms using relationships such as <b>inheres-in </b><abbrgrp><abbr bid="B17">17</abbr></abbrgrp> and categories from PATO <abbrgrp><abbr bid="B37">37</abbr></abbrgrp> (an ontology of phenotypic properties), MA and others. The MP provides property concepts such as <it>absent_tail</it>, although we believe that it would be more adequate to term this property <it>absence of a tail</it>, because <it>absent_tail </it>suggests a reading as an object concept, namely as a tail which is absent. These properties can be composed with object concepts, e.g. <it>adult mouse</it>, in order to refer to more specific object concepts like an <it>adult mouse without a tail </it>(without explicating all of these in advance). Formally, the category <it>absent_tail </it>is defined as the intersection of <it>PATO:lacking physical parts</it>, <b>inheres-in </b><it>MA:adult mouse</it>, and <b>towards </b><it>MA:tail</it>. The translation to OWL <abbrgrp><abbr bid="B36">36</abbr></abbrgrp> yields</p>
               <p>
                  <monospace>EquivalentClasses(absent_tail</monospace>
               </p>
               <p>
                  <monospace>&#160;&#160;&#160;intersectionOf(</monospace>
               </p>
               <p>
                  <monospace>&#160;&#160;&#160;&#160;&#160;&#160;PATO:lacking_physical_parts</monospace>
               </p>
               <p>
                  <monospace>&#160;&#160;&#160;&#160;&#160;&#160;restriction(inheres-in someValuesFrom(MA:adult_mouse))</monospace>
               </p>
               <p>
                  <monospace>&#160;&#160;&#160;&#160;&#160;&#160;restriction(towards someValuesFrom(MA:tail))))</monospace>
               </p>
               <p>Such formalization has the problem that a reduction of <it>absent_tail </it>to relationships between individuals is inappropriate. It becomes manifest in restriction(towards someValuesFrom(MA:tail)), which enforces the existence of an instance of <it>MA:tail </it>in the OWL model <abbrgrp><abbr bid="B38">38</abbr></abbrgrp> &#8211; yet, ontologically, there is no instance of tail if the mouse does not have a tail. If "absent tail" is taken literally, i.e., a "virtual" tail with a property of "absence" is accepted in the OWL model, the immediate objection is weakened. However, this would either imply that the <b>towards </b>link points to an arbitrary tail of some other entity, or that the mouse with the absent tail does have a tail (which may have the propery of being "absent"). This causes at the very least some inconveniences, e.g. when querying such a model for tails, one must pay attention to exclude all virtual tails. We expect that a general application of this approach to many object classes cannot be controlled with reasonable effort. The underlying problem here is a different kind of concept composition compared to that which is commonly employed in description logics and the semantics of the OBO file format <abbrgrp><abbr bid="B36">36</abbr></abbrgrp>. For composing the concept <it>absent_tail </it>with recourse to tail, a direct link from <it>absent_tail </it>to the OWL class <it>MA:tail </it>would be required instead of a link to <it>instances </it>of the class <it>MA:tail</it>. However, links on the class level are not available if the formalization is supposed to adhere to the decidable description logic variant of OWL.</p>
               <p>Other problems occur if the lack of a certain part is considered with respect to (sub-)parts of it. For example, a caudal vertebra is a part of a tail. The logical definition for <it>absent caudal vertebra </it>can be formulated similarly to the one for the <it>absent_tail</it>. Then the question arises to which entity the PATO property <b>inheres-in </b>should link. If <it>tail </it>is chosen, this definition cannot be applied to mice lacking a tail, because then there is nothing to inhere in. Another option is to link to mouse instead. In both cases, whenever a mouse lacks a tail as part, it also lacks all parts of the tail as part. Since each instance of <it>caudal vertebra </it>which is a part of a mouse is part of its tail, a mouse without tail lacks a <it>caudal vertebra</it>. This conclusion cannot be drawn in the approach currently taken by the MP. Moreover, we do not want to conclude that a mouse has a <it>caudal vertebra </it>as part when it lacks a <it>tail</it>.</p>
               <p>Therefore, our suggestion is to introduce the relationship <b>lacks-part </b>and to define terms of the type <it>absent_X </it>as standing in the <b>lacks-part </b>relationship to <it>X</it>. Then, <it>absent_X </it>terms refer to categories of objects instead of properties, and those categories can be viewed as a reification of the binary <b>lacks-part </b>relation. For example, <it>absent_tail </it>would be defined as</p>
               <p>
                  <monospace>[Term]</monospace>
               </p>
               <p>
                  <monospace>id: MP:0003456</monospace>
               </p>
               <p>
                  <monospace>name: absent tail</monospace>
               </p>
               <p>
                  <monospace>relationship: lacks_part MA:0000008 ! tail</monospace>
               </p>
               <p>By design, this use of <b>lacks-part </b>does not have the problem of non-existent instances. It also does not permit the conclusion that a mouse has a <it>caudal vertebra </it>as part when a mouse lacks a <it>tail</it>.</p>
            </sec>
         </sec>
      </sec>
      <sec>
         <st>
            <p>Discussion</p>
         </st>
         <p>Meaningful integration of the numerous biomedical ontologies is a major task with many challenges. Currently, the infrastructure for such integration is developed in the form of top-level ontologies, biomedical core ontologies and logic-based inference systems.</p>
         <sec>
            <st>
               <p>Concept conversion</p>
            </st>
            <p>The formalism we introduced requires reformulating the definitions for the categories expressed in phenotype ontologies. Categories in the form "absent-X" should be defined by, e.g., <b>CC-lacks-part </b><it>X</it>, where <it>X </it>is a category in some canonical ontology. In some cases, this conversion can be done automatically using simple pattern matches. The Mammalian Phenotype Ontology <abbrgrp><abbr bid="B10">10</abbr></abbrgrp> contains 395 categories of the type "absent-X", which indicate a <b>CC-lacks-part </b>relationship. However, it is likely that an amount of manual curation will be required to convert relevant concepts into the required form. We believe that the advantages gained by having a common framework for integrating a large number of biomedical ontologies justifies this effort, in particular since it also allows for a semantically richer definition of terms.</p>
         </sec>
         <sec>
            <st>
               <p>Defaults and canonical knowledge</p>
            </st>
            <p>We introduce the notion of "default knowledge" as a technical term within the formalism we propose. We do not discuss what a "default" is, or when a piece of knowledge becomes a default, in contrast to merely contingent knowledge. Developers of domain ontologies must decide this. Widespread acceptance of some fact, its sanction by scientific discourse, or its implicit use in scientific writing may provide starting points for finding defaults. These principles have been used to construct the Foundational Model of Anatomy <abbrgrp><abbr bid="B9">9</abbr></abbrgrp> (FMA). The Mammalian Phenotype Ontology classifies categories almost exclusively under categories named "abnormal-X". The ontology of phenotypic properties (PATO) contains the property of being "abnormal". Each of the corresponding categories and annotations can be investigated and the corresponding default rule identified. Not all pieces of information contained in ontologies such as the FMA will be default knowledge, but we expect that a significant number of facts can be translated to the formalisms we propose, thereby making the nature of the fact as a default explicit.</p>
            <p>There is a difference between canonical and default knowledge, in particular in the context of anatomy. Canonical human anatomy, for example, describes an idealized, prototypical human being. This does not necessarily coincide with a normal human being, i.e. in the sense of statistically averaged values. Defaults, on the other hand, tend to capture in their commonsense usage the <it>normal </it>cases of a category. We believe that the framework of default logic, compared with other systems, provides the most adequate interpretation for canonical knowledge. However, while certainly needed, a precise distinction between normal, default and canonical knowledge is out of the scope of this study.</p>
         </sec>
         <sec>
            <st>
               <p>Comparison with other approaches</p>
            </st>
            <p>The important role of accommodating exceptions and defaults in biomedical knowledge representation has been recognized previously <abbrgrp><abbr bid="B39">39</abbr></abbrgrp>, where patterns to deal with a variety of cases were introduced and discussed. These cases are based on the description logic fragment of OWL <abbrgrp><abbr bid="B21">21</abbr></abbrgrp>, and therefore monotonic logic. In <abbrgrp><abbr bid="B39">39</abbr></abbrgrp>, three types of exceptions that occur in biomedical knowledge bases are distinguished:</p>
            <p>1. Single exceptions: "Arteries carry oxygenated blood" except for the pulmonary artery. In <abbrgrp><abbr bid="B39">39</abbr></abbrgrp>, it is proposed to reformulate this statement to "Arteries except the pulmonary artery carry oxygenated blood".</p>
            <p>2. Exceptions due to context: "The normal human manus has five digits", with "human" and "normal" being treated as explicit contexts.</p>
            <p>3. Unpredictable number of exceptions, exceptions from exceptions, etc., such as drug uses, contraindications and interactions.</p>
            <p>We offer a method for representing these types of exceptions using a nonmonotonic knowledge representation formalism. We use answer set programs to provide the semantics for treating knowledge in OWL as default knowledge with additional exceptions. This does not exclude the possibility to treat these types of exceptions exclusively in a monotonic logic such as OWL where appropriate, for which <abbrgrp><abbr bid="B39">39</abbr></abbrgrp> provides a solution. The solution in <abbrgrp><abbr bid="B39">39</abbr></abbrgrp> to the example of arteries carrying oxygenated blood, except the pulmonary artery, has the problem that it must be explicitly known that some artery is <it>not </it>the pulmonary artery, in order to conclude that this artery carries oxygenated blood. There may be cases where this is not wanted, especially if the exception occurs very rarely. In particular, if there is only one rare exception to a rule and some statement influencing the property which changes with this exception is asserted, then the knowledge engineer will usually make this exception explicit, and ignore it otherwise. Then, a question whether an artery carries oxygenated blood evaluates to true, except when it is <it>proven </it>that this artery is the pulmonary artery. On the other hand, the solution proposed by <abbrgrp><abbr bid="B39">39</abbr></abbrgrp> is guaranteed to provide the correct inference in every case. Depending on the users and uses of a knowledge base or ontology, different representations for this case may be selected, and in many cases the treatment in <abbrgrp><abbr bid="B39">39</abbr></abbrgrp> is adequate.</p>
            <p>Case two is solved by explicitly introducing a context argument, in the form of additional properties, e.g., by introducing some relation <it>hasAnatomicalStatus </it>which maps to "normal". Then, a <it>Mouse </it>that has an anatomical status "normal" could have, e.g., a tail and a head as part. If a mouse had no tail, it can be concluded that it is an anatomically abnormal mouse. However, then it would be impossible to conclude that it still has a head. An extension to the solution in <abbrgrp><abbr bid="B39">39</abbr></abbrgrp> would be to make the context more fine-grained, by specifying mouse with anatomically normal tails, heads, and so on. This comes down to specifying an enormous number of exceptions in a monotonic logic, and in order to obtain a correct answer to a query for all the parts of some individual mouse, all these exceptions must be explicitly excluded. It would not be possible to simply state that some entity is a mouse in order to obtain its parts. Instead it is required to specify explicitly which parts are normal and abnormal, which means in essence to add the answers to the query asked.</p>
            <p>The third case in <abbrgrp><abbr bid="B39">39</abbr></abbrgrp> is closest in spirit to our work, as one of the proposals is to use a hybrid reasoning system in order to deal with it. We have extended this idea by giving a formal account of our treatment of exceptions, which is based on a well-studied nonmonotonic logic, and is implemented in a computationally tractable framework. It can also be used in conjunction with appropriate upper ontologies. Further, we have shown how to use this formalism to achieve interoperability between canonical and phenotype ontologies in biology. And finally, we give an implementation of our ontology and support for reasoning over exceptions. This could be achieved because recent years have seen an increasing effort in developing reasoners for the Semantic Web and extending them in various ways, among them the implementation we are using, DLVHEX.</p>
            <p>We believe that our solution to the problem of exceptions and deviations from a canonical ontology is more general than the proposal in <abbrgrp><abbr bid="B39">39</abbr></abbrgrp>. In our opinion, the knowledge contained in a canonical ontology is inherently default knowledge. There is no adequate solution for representing this type of knowledge in a monotonic knowledge representation formalism. Representation in monotonic logic requires exceptions to be encoded in the ontology either as a list of exceptions to an axiom, or using a general "abnormality" predicate. For example, the fact that mice usually have some tail as part can be represented as "Mouse <b>has-part </b>Tail except when ..." followed by a complete list of exceptions. Alternatively, "Mouse" can be replaced by "normal mouse" in the rule, and a mouse without a tail is not normal. The first solution requires complete knowledge of all known exceptions. These must additionally be explicitly excluded in every query for parts of the mouse. The second way does not require this knowledge of exceptions, but allows for no further inferences once a mouse is known to be not normal. Defaults and exceptions cannot be dealt with in a monotonic logic without substantially modifying the canonical ontology, and limiting the ability to query the ontology.</p>
         </sec>
         <sec>
            <st>
               <p>Limitations</p>
            </st>
            <p>A major drawback of the system we are using, DLVHEX, is its use of RACER <abbrgrp><abbr bid="B40">40</abbr></abbrgrp> as a description logic reasoner and of DLV <abbrgrp><abbr bid="B33">33</abbr></abbrgrp> as a datalog system. RACER and DLV are proprietary software. In order to be of general use and high quality, an implementation entirely based on free software is beneficial, if not necessary <abbrgrp><abbr bid="B41">41</abbr><abbr bid="B42">42</abbr></abbrgrp>.</p>
            <p>A number of formalisms have been proposed as a solution to handling defaults in Semantic Web representation languages or other knowledge representation formalisms. Many require modifying the language, and therefore changing tools that are used to develop ontologies. Many biomedical ontologies are developed using tools such as OBO-Edit <abbrgrp><abbr bid="B43">43</abbr></abbrgrp> by biology experts, but not necessarily experts in logic or formal ontology. The solution we propose requires no changes to existing tools, since we are using a hybrid reasoning mechanism. Tools that are currently in use can be used further by the ontology developers. The additional semantic features that allow for the treatment of canonical relations as defaults are maintained separately from the ontologies in which they are used.</p>
         </sec>
      </sec>
      <sec>
         <st>
            <p>Conclusion</p>
         </st>
         <p>In this paper we tackle the problem of integrating biomedical ontologies to facilitate interoperability among them and thus among information systems based on them. We particularly focus on adequately treating two kinds of ontologies, namely canonical and phenotype ontologies, e.g., the Mouse Anatomy ontology and the Mammalian Phenotype ontology. Given this distinction, we have argued that canonical ontologies represent default knowledge. Their integration with ontologies covering phenotypes may thus lead to inconsistencies if used within a classical logic framework, because some phenotypic descriptions are exceptions to defaults. We have shown how existing techniques from knowledge representation can be used to resolve these problems. Moreover, our solution uses the biological core ontology GFO-Bio as an ontological foundation, which provides support for our solution through higher order categories and relations. Integrating canonical and phenotype ontologies, however, requires both an appropriate ontological basis as well as a nonmonotonic representation formalism.</p>
         <p>Our work primarily extends the OBO Relationship Ontology <abbrgrp><abbr bid="B6">6</abbr></abbrgrp>, and requires few changes to domain ontologies. In particular, our proposal does not require modifications in the tools that domain ontology developers use for curating ontologies, or changes in the way these ontologies are developed and stored. Our solution remains fully compatible with the OBO representation format, and addresses all logical, formal and computational requirements in our proposed extension to the OBO Relationship Ontology. It is there that nonmonotonic semantics must be made available to users. In its current form, based on a classical, monotonic logic, the OBO Relationship Ontology cannot support interoperability between all ontologies that will become part of the OBO Foundry, in particular between anatomy and phenotype ontologies. Our proposal aims to bring about effective interoperability and integration between the ontologies in the OBO Foundry without the need to modify the representation formalism or the tools used in ontology curation and analysis.</p>
      </sec>
      <sec>
         <st>
            <p>Availability and Requirements</p>
         </st>
         <p>Project name: GFO-Bio/NMR</p>
         <p>Project homepage: <url>http://bioonto.de/pmwiki.php/Main/NonmonotonicReasoning</url></p>
         <p>Operating systems: GFO-Bio and axiomatization are platform independent, reasoning using DLVHEX requires GNU/Linux or Mac OS X.</p>
         <p>Programming languages: OWL, Semantic Web Rule Langue (SWRL), datalog, Java Other requirements: Parts of our implementation require DLVHEX, DLV and RACER.</p>
         <p>License: Modified BSD License. DLVHEX requires RACER and DLV. Both are proprietary software.</p>
      </sec>
      <sec>
         <st>
            <p>Competing interests</p>
         </st>
         <p>The authors declare that there are no competing interests.</p>
      </sec>
      <sec>
         <st>
            <p>Authors' contributions</p>
         </st>
         <p>HH conceived the initial idea on using nonmonotonic reasoning for integrating ontologies, RH the relevance for anatomy and phenotype ontologies. HH, FL, JK and RH designed the framework for consistent integration of anatomy and phenotype ontologies. RH implemented the framework and performed the tests. All authors contributed to writing the paper, have read and approved the final version of this manuscript.</p>
      </sec>
   </bdy>
   <bm>
      <ack>
         <sec>
            <st>
               <p>Acknowledgements</p>
            </st>
            <p>We are grateful to Roberto Poli for enlightening discussions and his initial ideas on facet analysis and the theory of levels of reality. We thank Kay Pr&#252;fer for his comments on an early draft of this paper, and Roman Schindlauer and Thomas Krennwallner for their patch for and help with DLVHEX. We thank two anonymous reviewers for their valuable comments.</p>
            <p>We thank the Max Planck Society and the Institute of Medical Informatics, Statistics and Epidemiology at the University of Leipzig for funding.</p>
            <p>Thanks to Christine Green for her help in preparing the English manuscript.</p>
         </sec>
      </ack>
      <refgrp>
         <bibl id="B1">
            <title>
               <p>The Adult Mouse Anatomical Dictionary: a tool for annotating and integrating data</p>
            </title>
            <aug>
               <au>
                  <snm>Hayamizu</snm>
                  <fnm>TF</fnm>
               </au>
               <au>
                  <snm>Mangan</snm>
                  <fnm>M</fnm>
               </au>
               <au>
                  <snm>Corradi</snm>
                  <fnm>JP</fnm>
               </au>
               <au>
                  <snm>Kadin</snm>
                  <fnm>JA</fnm>
               </au>
               <au>
                  <snm>Ringwald</snm>
                  <fnm>M</fnm>
               </au>
            </aug>
            <source>Genome Biology</source>
            <pubdate>2005</pubdate>
            <volume>6</volume>
            <issue>3</issue>
            <fpage>R29</fpage>
            <xrefbib>
               <pubidlist>
                  <pubid idtype="pmcid">1088948</pubid>
                  <pubid idtype="pmpid" link="fulltext">15774030</pubid>
                  <pubid idtype="doi">10.1186/gb-2005-6-3-r29</pubid>
               </pubidlist>
            </xrefbib>
         </bibl>
         <bibl id="B2">
            <title>
               <p>Gene ontology: tool for the unification of biology</p>
            </title>
            <aug>
               <au>
                  <snm>Ashburner</snm>
                  <fnm>M</fnm>
               </au>
               <au>
                  <snm>Ball</snm>
                  <fnm>CA</fnm>
               </au>
               <au>
                  <snm>Blake</snm>
                  <fnm>JA</fnm>
               </au>
               <au>
                  <snm>Botstein</snm>
                  <fnm>D</fnm>
               </au>
               <au>
                  <snm>Butler</snm>
                  <fnm>H</fnm>
               </au>
               <au>
                  <snm>Cherry</snm>
                  <fnm>JM</fnm>
               </au>
               <au>
                  <snm>Davis</snm>
                  <fnm>AP</fnm>
               </au>
               <au>
                  <snm>Dolinski</snm>
                  <fnm>K</fnm>
               </au>
               <au>
                  <snm>Dwight</snm>
                  <fnm>SS</fnm>
               </au>
               <au>
                  <snm>Eppig</snm>
                  <fnm>JT</fnm>
               </au>
               <au>
                  <snm>Harris</snm>
                  <fnm>MA</fnm>
               </au>
               <au>
                  <snm>Hill</snm>
                  <fnm>DP</fnm>
               </au>
               <au>
                  <snm>Issel-Tarver</snm>
                  <fnm>L</fnm>
               </au>
               <au>
                  <snm>Kasarskis</snm>
                  <fnm>A</fnm>
               </au>
               <au>
                  <snm>Lewis</snm>
                  <fnm>S</fnm>
               </au>
               <au>
                  <snm>Matese</snm>
                  <fnm>JC</fnm>
               </au>
               <au>
                  <snm>Richardson</snm>
                  <fnm>JE</fnm>
               </au>
               <au>
                  <snm>Ringwald</snm>
                  <fnm>M</fnm>
               </au>
               <au>
                  <snm>Rubin</snm>
                  <fnm>GM</fnm>
               </au>
               <au>
                  <snm>Sherlock</snm>
                  <fnm>G</fnm>
               </au>
            </aug>
            <source>Nature Genetics</source>
            <pubdate>2000</pubdate>
            <volume>25</volume>
            <fpage>25</fpage>
            <lpage>29</lpage>
            <xrefbib>
               <pubidlist>
                  <pubid idtype="doi">10.1038/75556</pubid>
                  <pubid idtype="pmpid" link="fulltext">10802651</pubid>
               </pubidlist>
            </xrefbib>
         </bibl>
         <bibl id="B3">
            <title>
               <p>Disease Ontology</p>
            </title>
            <aug>
               <au>
                  <snm>Chrisholm</snm>
                  <fnm>R</fnm>
               </au>
               <au>
                  <snm>Kibbe</snm>
                  <fnm>W</fnm>
               </au>
               <au>
                  <snm>Osborne</snm>
                  <fnm>J</fnm>
               </au>
               <au>
                  <snm>Wolf</snm>
                  <fnm>W</fnm>
               </au>
               <au>
                  <snm>Doyle</snm>
                  <fnm>M</fnm>
               </au>
               <au>
                  <snm>Doyle</snm>
                  <fnm>AO</fnm>
               </au>
               <au>
                  <snm>Smith</snm>
                  <fnm>M</fnm>
               </au>
               <au>
                  <snm>Zhu</snm>
                  <fnm>J</fnm>
               </au>
            </aug>
            <url>http://diseaseontology.sourceforge.net</url>
         </bibl>
         <bibl id="B4">
            <title>
               <p>Plant Ontology (PO)</p>
            </title>
            <aug>
               <au>
                  <cnm>The Plant Ontology Consortium</cnm>
               </au>
            </aug>
            <url>http://www.plantontology.org</url>
         </bibl>
         <bibl id="B5">
            <title>
               <p>Building Mouse Phenotype Ontologies</p>
            </title>
            <aug>
               <au>
                  <snm>Gkoutos</snm>
                  <fnm>GV</fnm>
               </au>
               <au>
                  <snm>Green</snm>
                  <fnm>ECJ</fnm>
               </au>
               <au>
                  <snm>Mallon</snm>
                  <fnm>AM</fnm>
               </au>
               <au>
                  <snm>Hancock</snm>
                  <fnm>JM</fnm>
               </au>
               <au>
                  <snm>Davidson</snm>
                  <fnm>D</fnm>
               </au>
            </aug>
            <source>Proceedings of the 9th Pacific Symposium on Biocomputing (PSB 2004), Hawaii, USA, Jan 6&#8211;10</source>
            <publisher>London: World Scientific</publisher>
            <editor>Altman RB, Dunker AK, Hunter L, Jung TA, Klein TE</editor>
            <pubdate>2004</pubdate>
            <fpage>178</fpage>
            <lpage>189</lpage>
         </bibl>
         <bibl id="B6">
            <title>
               <p>Relations in biomedical ontologies</p>
            </title>
            <aug>
               <au>
                  <snm>Smith</snm>
                  <fnm>B</fnm>
               </au>
               <au>
                  <snm>Ceusters</snm>
                  <fnm>W</fnm>
               </au>
               <au>
                  <snm>Klagges</snm>
                  <fnm>B</fnm>
               </au>
               <au>
                  <snm>K&#246;hler</snm>
                  <fnm>J</fnm>
               </au>
               <au>
                  <snm>Kumar</snm>
                  <fnm>A</fnm>
               </au>
               <au>
                  <snm>Lomax</snm>
                  <fnm>J</fnm>
               </au>
               <au>
                  <snm>Mungall</snm>
                  <fnm>C</fnm>
               </au>
               <au>
                  <snm>Neuhaus</snm>
                  <fnm>F</fnm>
               </au>
               <au>
                  <snm>Rector</snm>
                  <fnm>AL</fnm>
               </au>
               <au>
                  <snm>Rosse</snm>
                  <fnm>C</fnm>
               </au>
            </aug>
            <source>Genome Biology</source>
            <pubdate>2005</pubdate>
            <volume>6</volume>
            <issue>5</issue>
            <fpage>R46</fpage>
            <xrefbib>
               <pubidlist>
                  <pubid idtype="pmcid">1175958</pubid>
                  <pubid idtype="pmpid" link="fulltext">15892874</pubid>
                  <pubid idtype="doi">10.1186/gb-2005-6-5-r46</pubid>
               </pubidlist>
            </xrefbib>
         </bibl>
         <bibl id="B7">
            <title>
               <p>Open Biomedical Ontologies (OBO) Foundry</p>
            </title>
            <url>http://obofoundry.org</url>
         </bibl>
         <bibl id="B8">
            <title>
               <p>OBO Foundry Principles</p>
            </title>
            <url>http://obofoundry.org/crit.shtml</url>
         </bibl>
         <bibl id="B9">
            <title>
               <p>A Reference Ontology for Biomedical Informatics: the Foundational Model of Anatomy</p>
            </title>
            <aug>
               <au>
                  <snm>Rosse</snm>
                  <fnm>C</fnm>
               </au>
               <au>
                  <snm>Mejino</snm>
                  <fnm>JLV</fnm>
                  <suf>Jr</suf>
               </au>
            </aug>
            <source>Journal of Biomedical Informatics</source>
            <pubdate>2003</pubdate>
            <volume>36</volume>
            <issue>6</issue>
            <fpage>478</fpage>
            <lpage>500</lpage>
            <xrefbib>
               <pubidlist>
                  <pubid idtype="doi">10.1016/j.jbi.2003.11.007</pubid>
                  <pubid idtype="pmpid" link="fulltext">14759820</pubid>
               </pubidlist>
            </xrefbib>
         </bibl>
         <bibl id="B10">
            <title>
               <p>The Mammalian Phenotype Ontology as a tool for annotating, analyzing and comparing phenotypic information</p>
            </title>
            <aug>
               <au>
                  <snm>Smith</snm>
                  <fnm>CL</fnm>
               </au>
               <au>
                  <snm>Goldsmith</snm>
                  <fnm>CAW</fnm>
               </au>
               <au>
                  <snm>Eppig</snm>
                  <fnm>JT</fnm>
               </au>
            </aug>
            <source>Genome Biology</source>
            <pubdate>2004</pubdate>
            <volume>6</volume>
            <fpage>R7</fpage>
            <xrefbib>
               <pubidlist>
                  <pubid idtype="pmcid">549068</pubid>
                  <pubid idtype="pmpid" link="fulltext">15642099</pubid>
                  <pubid idtype="doi">10.1186/gb-2004-6-1-r7</pubid>
               </pubidlist>
            </xrefbib>
         </bibl>
         <bibl id="B11">
            <aug>
               <au>
                  <snm>Sowa</snm>
                  <fnm>JF</fnm>
               </au>
            </aug>
            <source>Knowledge Representation: Logical, Philosophical and Computational Foundations</source>
            <publisher>Pacific Grove: Brooks/Cole</publisher>
            <pubdate>2000</pubdate>
         </bibl>
         <bibl id="B12">
            <title>
               <p>Ontology mapping: the state of the art</p>
            </title>
            <aug>
               <au>
                  <snm>Kalfoglou</snm>
                  <fnm>Y</fnm>
               </au>
               <au>
                  <snm>Schorlemmer</snm>
                  <fnm>M</fnm>
               </au>
            </aug>
            <source>The Knowledge Engineering Review</source>
            <pubdate>2003</pubdate>
            <volume>18</volume>
            <fpage>1</fpage>
            <lpage>31</lpage>
            <xrefbib>
               <pubid idtype="doi">10.1017/S0269888903000651</pubid>
            </xrefbib>
         </bibl>
         <bibl id="B13">
            <title>
               <p>Ontology-based Integration of Information &#8211; A Survey of Existing Approaches</p>
            </title>
            <aug>
               <au>
                  <snm>Wache</snm>
                  <fnm>H</fnm>
               </au>
               <au>
                  <snm>V&#246;gele</snm>
                  <fnm>T</fnm>
               </au>
               <au>
                  <snm>Visser</snm>
                  <fnm>U</fnm>
               </au>
               <au>
                  <snm>Stuckenschmidt</snm>
                  <fnm>H</fnm>
               </au>
               <au>
                  <snm>Schuster</snm>
                  <fnm>G</fnm>
               </au>
               <au>
                  <snm>Neumann</snm>
                  <fnm>H</fnm>
               </au>
               <au>
                  <snm>H&#252;bner</snm>
                  <fnm>S</fnm>
               </au>
            </aug>
            <source>Proceedings of the IJCAI'01 Workshop on Ontologies and Information Sharing, Seattle, Washington, USA, Aug 4&#8211;5</source>
            <editor>Stuckenschmidt H, G&#243;mez-P&#233;rez A, Gruninger M, Uschold M</editor>
            <pubdate>2001</pubdate>
            <fpage>108</fpage>
            <lpage>117</lpage>
         </bibl>
         <bibl id="B14">
            <title>
               <p>General Formal Ontology (GFO) &#8211; A Foundational Ontology Integrating Objects and Processes [Version 1.0]</p>
            </title>
            <aug>
               <au>
                  <snm>Herre</snm>
                  <fnm>H</fnm>
               </au>
               <au>
                  <snm>Heller</snm>
                  <fnm>B</fnm>
               </au>
               <au>
                  <snm>Burek</snm>
                  <fnm>P</fnm>
               </au>
               <au>
                  <snm>Hoehndorf</snm>
                  <fnm>R</fnm>
               </au>
               <au>
                  <snm>Loebe</snm>
                  <fnm>F</fnm>
               </au>
               <au>
                  <snm>Michalek</snm>
                  <fnm>H</fnm>
               </au>
            </aug>
            <source>Onto-Med Report 8, Research Group Ontologies in Medicine, Institute of Medical Informatics, Statistics and Epidemiology, University of Leipzig, Leipzig, Germany</source>
            <pubdate>2006</pubdate>
         </bibl>
         <bibl id="B15">
            <title>
               <p>BFO in a Nutshell: A Bi-categorial Axiomatization of BFO and Comparison with DOLCE</p>
            </title>
            <aug>
               <au>
                  <snm>Grenon</snm>
                  <fnm>P</fnm>
               </au>
            </aug>
            <source>IFOMIS Report 06/2003, Institute for Formal Ontology and Medical Information Science (IFOMIS), University of Leipzig, Leipzig, Germany</source>
            <pubdate>2003</pubdate>
         </bibl>
         <bibl id="B16">
            <title>
               <p>Spatio-temporality in Basic Formal Ontology: SNAP and SPAN, Upper-Level Ontology, and Framework for Formalization: PART I</p>
            </title>
            <aug>
               <au>
                  <snm>Grenon</snm>
                  <fnm>P</fnm>
               </au>
            </aug>
            <source>IFOMIS Report 05/2003, Institute for Formal Ontology and Medical Information Science (IFOMIS), University of Leipzig, Leipzig, Germany</source>
            <pubdate>2003</pubdate>
         </bibl>
         <bibl id="B17">
            <title>
               <p>WonderWeb Deliverable D18: Ontology Library (final)</p>
            </title>
            <aug>
               <au>
                  <snm>Masolo</snm>
                  <fnm>C</fnm>
               </au>
               <au>
                  <snm>Borgo</snm>
                  <fnm>S</fnm>
               </au>
               <au>
                  <snm>Gangemi</snm>
                  <fnm>A</fnm>
               </au>
               <au>
                  <snm>Guarino</snm>
                  <fnm>N</fnm>
               </au>
               <au>
                  <snm>Oltramari</snm>
                  <fnm>A</fnm>
               </au>
            </aug>
            <source>Tech rep, Laboratory for Applied Ontology &#8211; ISTC-CNR, Trento, Italy</source>
            <pubdate>2003</pubdate>
         </bibl>
         <bibl id="B18">
            <title>
               <p>The Basic Problem of the Theory of Levels of Reality</p>
            </title>
            <aug>
               <au>
                  <snm>Poli</snm>
                  <fnm>R</fnm>
               </au>
            </aug>
            <source>Axiomathes</source>
            <pubdate>2001</pubdate>
            <volume>12</volume>
            <issue>3&#8211;4</issue>
            <fpage>261</fpage>
            <lpage>283</lpage>
            <xrefbib>
               <pubid idtype="doi">10.1023/A:1015845217681</pubid>
            </xrefbib>
         </bibl>
         <bibl id="B19">
            <title>
               <p>GFO-Bio: A biomedical core ontology</p>
            </title>
            <aug>
               <au>
                  <snm>Hoehndorf</snm>
                  <fnm>R</fnm>
               </au>
               <au>
                  <snm>Loebe</snm>
                  <fnm>F</fnm>
               </au>
               <au>
                  <snm>Poli</snm>
                  <fnm>R</fnm>
               </au>
               <au>
                  <snm>Kelso</snm>
                  <fnm>J</fnm>
               </au>
               <au>
                  <snm>Herre</snm>
                  <fnm>H</fnm>
               </au>
            </aug>
            <url>http://onto.eva.mpg.de/gfo-bio.html</url>
         </bibl>
         <bibl id="B20">
            <title>
               <p>Towards principled core ontologies</p>
            </title>
            <aug>
               <au>
                  <snm>Valente</snm>
                  <fnm>A</fnm>
               </au>
               <au>
                  <snm>Breuker</snm>
                  <fnm>J</fnm>
               </au>
            </aug>
            <source>Proceedings of the 10th Knowledge Acquisition Workshop (KAW'96), Banff, Alberta, Canada, Nov 9&#8211;14</source>
            <editor>Gaines BR, Musen MA</editor>
            <pubdate>1996</pubdate>
            <fpage>301</fpage>
            <lpage>320</lpage>
         </bibl>
         <bibl id="B21">
            <title>
               <p>OWL Web Ontology Language Overview</p>
            </title>
            <aug>
               <au>
                  <snm>McGuinness</snm>
                  <fnm>DL</fnm>
               </au>
               <au>
                  <snm>van Harmelen</snm>
                  <fnm>F</fnm>
               </au>
            </aug>
            <source>W3C recommendation, World Wide Web Consortium (W3C)</source>
            <pubdate>2004</pubdate>
         </bibl>
         <bibl id="B22">
            <title>
               <p>Multidimensional Classification of Concepts and Terms</p>
            </title>
            <aug>
               <au>
                  <snm>Bowker</snm>
                  <fnm>L</fnm>
               </au>
            </aug>
            <source>Handbook of Terminology Management, Basic Aspects of Terminology Management</source>
            <publisher>Amsterdam: John Benjamins</publisher>
            <editor>Wright SE, Budin G</editor>
            <pubdate>1997</pubdate>
            <volume>1</volume>
         </bibl>
         <bibl id="B23">
            <title>
               <p>Referent Tracking: The Problem of Negative Findings</p>
            </title>
            <aug>
               <au>
                  <snm>Ceusters</snm>
                  <fnm>W</fnm>
               </au>
               <au>
                  <snm>Elkin</snm>
                  <fnm>P</fnm>
               </au>
               <au>
                  <snm>Smith</snm>
                  <fnm>B</fnm>
               </au>
            </aug>
            <source>Ubiquity: Technologies for Better Health in Aging Societies: Proceedings of MIE Volume 124 of Studies in Health Technology and Informatics</source>
            <publisher>Amsterdam: IOS Press</publisher>
            <editor>Hasman A, Haux R, van der Lei J, De Clercq E, Roger-France F</editor>
            <pubdate>2006</pubdate>
            <fpage>741</fpage>
            <lpage>746</lpage>
         </bibl>
         <bibl id="B24">
            <aug>
               <au>
                  <snm>Hilbert</snm>
                  <fnm>D</fnm>
               </au>
               <au>
                  <snm>Ackermann</snm>
                  <fnm>W</fnm>
               </au>
               <au>
                  <snm>Luce</snm>
                  <fnm>RE</fnm>
               </au>
            </aug>
            <source>Principles of Mathematical Logic</source>
            <publisher>American Mathematical Society</publisher>
            <pubdate>1999</pubdate>
         </bibl>
         <bibl id="B25">
            <aug>
               <au>
                  <snm>Baader</snm>
                  <fnm>F</fnm>
               </au>
               <au>
                  <snm>Calvanese</snm>
                  <fnm>D</fnm>
               </au>
               <au>
                  <snm>Mcguinness</snm>
                  <fnm>DL</fnm>
               </au>
               <au>
                  <snm>Nardi</snm>
                  <fnm>D</fnm>
               </au>
               <au>
                  <snm>Patel-Schneider</snm>
                  <fnm>PF</fnm>
               </au>
            </aug>
            <source>The Description Logic Handbook: Theory, Implementation, and Applications</source>
            <publisher>New York, NY, USA: Cambridge University Press</publisher>
            <pubdate>2003</pubdate>
         </bibl>
         <bibl id="B26">
            <title>
               <p>A logic for default reasoning</p>
            </title>
            <aug>
               <au>
                  <snm>Reiter</snm>
                  <fnm>R</fnm>
               </au>
            </aug>
            <source>Artificial Intelligence</source>
            <pubdate>1980</pubdate>
            <volume>13</volume>
            <issue>1&#8211;2</issue>
            <fpage>81</fpage>
            <lpage>132</lpage>
            <xrefbib>
               <pubid idtype="doi">10.1016/0004-3702(80)90014-4</pubid>
            </xrefbib>
         </bibl>
         <bibl id="B27">
            <title>
               <p>Circumscription &#8211; A form of non-monotonic reasoning</p>
            </title>
            <aug>
               <au>
                  <snm>McCarthy</snm>
                  <fnm>J</fnm>
               </au>
            </aug>
            <source>Artificial Intelligence</source>
            <pubdate>1980</pubdate>
            <volume>13</volume>
            <issue>1&#8211;2</issue>
            <fpage>27</fpage>
            <lpage>39</lpage>
            <xrefbib>
               <pubid idtype="doi">10.1016/0004-3702(80)90011-9</pubid>
            </xrefbib>
         </bibl>
         <bibl id="B28">
            <title>
               <p>Applications of circumscription to formalizing common-sense knowledge</p>
            </title>
            <aug>
               <au>
                  <snm>McCarthy</snm>
                  <fnm>J</fnm>
               </au>
            </aug>
            <source>Artificial Intelligence</source>
            <pubdate>1986</pubdate>
            <volume>28</volume>
            <fpage>89</fpage>
            <lpage>116</lpage>
            <xrefbib>
               <pubid idtype="doi">10.1016/0004-3702(86)90032-9</pubid>
            </xrefbib>
         </bibl>
         <bibl id="B29">
            <title>
               <p>On the relation between default and autoepistemic logic</p>
            </title>
            <aug>
               <au>
                  <snm>Konolige</snm>
                  <fnm>K</fnm>
               </au>
            </aug>
            <source>Artificial Intelligence</source>
            <pubdate>1988</pubdate>
            <volume>35</volume>
            <issue>3</issue>
            <fpage>343</fpage>
            <lpage>382</lpage>
            <xrefbib>
               <pubid idtype="doi">10.1016/0004-3702(88)90021-5</pubid>
            </xrefbib>
         </bibl>
         <bibl id="B30">
            <aug>
               <au>
                  <snm>Gabbay</snm>
                  <fnm>DM</fnm>
               </au>
               <au>
                  <snm>Hogger</snm>
                  <fnm>CJ</fnm>
               </au>
               <au>
                  <snm>Robinson</snm>
                  <fnm>JA</fnm>
               </au>
               <au>
                  <cnm>(Eds)</cnm>
               </au>
            </aug>
            <source>Handbook of Logic in Artificial Intelligence and Logic Programming, Nonmonotonic Reasoning and Uncertain Reasoning</source>
            <publisher>Oxford, UK: Oxford University Press</publisher>
            <pubdate>1994</pubdate>
            <volume>3</volume>
         </bibl>
         <bibl id="B31">
            <title>
               <p>Answer set programming and plan generation</p>
            </title>
            <aug>
               <au>
                  <snm>Lifschitz</snm>
                  <fnm>V</fnm>
               </au>
            </aug>
            <source>Artificial Intelligence</source>
            <pubdate>2002</pubdate>
            <volume>138</volume>
            <issue>1&#8211;2</issue>
            <fpage>39</fpage>
            <lpage>54</lpage>
            <xrefbib>
               <pubid idtype="doi">10.1016/S0004-3702(02)00186-8</pubid>
            </xrefbib>
         </bibl>
         <bibl id="B32">
            <title>
               <p>A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer Set Programming</p>
            </title>
            <aug>
               <au>
                  <snm>Eiter</snm>
                  <fnm>T</fnm>
               </au>
               <au>
                  <snm>Ianni</snm>
                  <fnm>G</fnm>
               </au>
               <au>
                  <snm>Schindlauer</snm>
                  <fnm>R</fnm>
               </au>
               <au>
                  <snm>Tompits</snm>
                  <fnm>H</fnm>
               </au>
            </aug>
            <source>Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), Edinburgh, Scotland, UK, Jul 30 -Aug 5</source>
            <publisher>Denver, Colorado: Professional Book Center</publisher>
            <editor>Pack Kaelbling L, Saffiotti A</editor>
            <pubdate>2005</pubdate>
            <fpage>90</fpage>
            <lpage>96</lpage>
         </bibl>
         <bibl id="B33">
            <title>
               <p>The DLV System for Knowledge Representation and Reasoning</p>
            </title>
            <aug>
               <au>
                  <snm>Leone</snm>
                  <fnm>N</fnm>
               </au>
               <au>
                  <snm>Pfeifer</snm>
                  <fnm>G</fnm>
               </au>
               <au>
                  <snm>Faber</snm>
                  <fnm>W</fnm>
               </au>
               <au>
                  <snm>Eiter</snm>
                  <fnm>T</fnm>
               </au>
               <au>
                  <snm>Gottlob</snm>
                  <fnm>G</fnm>
               </au>
               <au>
                  <snm>Perri</snm>
                  <fnm>S</fnm>
               </au>
               <au>
                  <snm>Scarcello</snm>
                  <fnm>F</fnm>
               </au>
            </aug>
            <source>ACM Transactions on Computational Logic</source>
            <pubdate>2006</pubdate>
            <volume>7</volume>
            <issue>3</issue>
            <fpage>499</fpage>
            <lpage>562</lpage>
            <xrefbib>
               <pubid idtype="doi">10.1145/1149114.1149117</pubid>
            </xrefbib>
         </bibl>
         <bibl id="B34">
            <title>
               <p>File Format Guide</p>
            </title>
            <url>http://www.geneontology.org/GO.format.shtml</url>
         </bibl>
         <bibl id="B35">
            <title>
               <p>An ontology for cell types</p>
            </title>
            <aug>
               <au>
                  <snm>Bard</snm>
                  <fnm>J</fnm>
               </au>
               <au>
                  <snm>Rhee</snm>
                  <fnm>SY</fnm>
               </au>
               <au>
                  <snm>Ashburner</snm>
                  <fnm>M</fnm>
               </au>
            </aug>
            <source>Genome Biology</source>
            <pubdate>2005</pubdate>
            <volume>6</volume>
            <issue>2</issue>
            <fpage>R21</fpage>
            <xrefbib>
               <pubidlist>
                  <pubid idtype="pmcid">551541</pubid>
                  <pubid idtype="pmpid" link="fulltext">15693950</pubid>
                  <pubid idtype="doi">10.1186/gb-2005-6-2-r21</pubid>
               </pubidlist>
            </xrefbib>
         </bibl>
         <bibl id="B36">
            <title>
               <p>The OBO to OWL mapping, GO to OWL 1.1!</p>
            </title>
            <aug>
               <au>
                  <snm>Golbreich</snm>
                  <fnm>C</fnm>
               </au>
               <au>
                  <snm>Horrocks</snm>
                  <fnm>I</fnm>
               </au>
            </aug>
            <source>Proceedings of the OWLED 2007 Workshop on OWL: Experiences and Directions, Innsbruck, Austria, Jun 6&#8211;7, Volume 258 of CEUR Workshop Proceedings</source>
            <publisher>Aachen, Germany: CEUR-WS.org</publisher>
            <editor>Golbreich C, Kalyanpur A, Parsia B</editor>
            <pubdate>2007</pubdate>
         </bibl>
         <bibl id="B37">
            <title>
               <p>PATO &#8211; Phenotypic Quality Ontology</p>
            </title>
            <aug>
               <au>
                  <cnm>OBO Phenotype Group</cnm>
               </au>
            </aug>
            <url>http://www.bioontology.org/wiki/index.php/PATO:Main_Page</url>
         </bibl>
         <bibl id="B38">
            <title>
               <p>OWL Web Ontology Language &#8211; Semantics and Abstract Syntax</p>
            </title>
            <aug>
               <au>
                  <snm>Patel-Schneider</snm>
                  <fnm>PF</fnm>
               </au>
               <au>
                  <snm>Hayes</snm>
                  <fnm>P</fnm>
               </au>
               <au>
                  <snm>Horrocks</snm>
                  <fnm>I</fnm>
               </au>
            </aug>
            <pubdate>2004</pubdate>
            <url>http://www.w3.org/TR/owl-semantics/</url>
         </bibl>
         <bibl id="B39">
            <title>
               <p>Defaults, Context, and Knowledge: Alternatives for OWL-Indexed Knowledge Bases</p>
            </title>
            <aug>
               <au>
                  <snm>Rector</snm>
                  <fnm>AL</fnm>
               </au>
            </aug>
            <source>Proceedings of the 9th Pacific Symposium on Biocomputing (PSB 2004), Hawaii, USA, Jan 6&#8211;10</source>
            <publisher>London: World Scientific</publisher>
            <editor>Altman RB, Dunker AK, Hunter L, Jung TA, Klein TE</editor>
            <pubdate>2004</pubdate>
            <fpage>226</fpage>
            <lpage>237</lpage>
         </bibl>
         <bibl id="B40">
            <title>
               <p>Racer: A Core Inference Engine for the Semantic Web</p>
            </title>
            <aug>
               <au>
                  <snm>Haarslev</snm>
                  <fnm>V</fnm>
               </au>
               <au>
                  <snm>M&#246;ller</snm>
                  <fnm>R</fnm>
               </au>
            </aug>
            <source>Proceedings of the 2nd International Workshop on Evaluation of Ontology-based Tools (EON2003), Sanibel Island, Florida, USA, Oct 20, Volume 87 of CEUR Workshop Proceedings</source>
            <publisher>Aachen, Germany: CEUR-WS.org</publisher>
            <editor>Sure Y, Corcho O</editor>
            <pubdate>2003</pubdate>
            <fpage>27</fpage>
            <lpage>36</lpage>
         </bibl>
         <bibl id="B41">
            <title>
               <p>The Cathedral and the Bazaar</p>
            </title>
            <aug>
               <au>
                  <snm>Raymond</snm>
                  <fnm>ES</fnm>
               </au>
            </aug>
            <source>Knowledge, Technology, and Policy</source>
            <pubdate>1999</pubdate>
            <volume>12</volume>
            <issue>3</issue>
            <fpage>23</fpage>
            <lpage>49</lpage>
            <xrefbib>
               <pubid idtype="doi">10.1007/s12130-999-1026-0</pubid>
            </xrefbib>
         </bibl>
         <bibl id="B42">
            <aug>
               <au>
                  <snm>Stallman</snm>
                  <fnm>RM</fnm>
               </au>
               <au>
                  <snm>Gay</snm>
                  <fnm>J</fnm>
               </au>
               <au>
                  <snm>Lessig</snm>
                  <fnm>L</fnm>
               </au>
            </aug>
            <source>Free Software, Free Society: Selected Essays of Richard M. Stallman</source>
            <publisher>Boston: Free Software Foundation</publisher>
            <pubdate>2002</pubdate>
         </bibl>
         <bibl id="B43">
            <title>
               <p>OBO-Edit &#8211; An Ontology Editor for Biologists</p>
            </title>
            <aug>
               <au>
                  <snm>Day-Richter</snm>
                  <fnm>J</fnm>
               </au>
               <au>
                  <snm>Harris</snm>
                  <fnm>MA</fnm>
               </au>
               <au>
                  <snm>Haendel</snm>
                  <fnm>M</fnm>
               </au>
               <au>
                  <cnm>The Gene Ontology OBO-Edit Working Group</cnm>
               </au>
               <au>
                  <snm>Lewis</snm>
                  <fnm>S</fnm>
               </au>
            </aug>
            <source>Bioinformatics</source>
            <pubdate>2007</pubdate>
            <volume>23</volume>
            <issue>16</issue>
            <fpage>2198</fpage>
            <lpage>2200</lpage>
            <xrefbib>
               <pubidlist>
                  <pubid idtype="doi">10.1093/bioinformatics/btm112</pubid>
                  <pubid idtype="pmpid" link="fulltext">17545183</pubid>
               </pubidlist>
            </xrefbib>
         </bibl>
         <bibl id="B44">
            <title>
               <p>SWRL: A Semantic Web Rule Language Combining OWL and RuleML</p>
            </title>
            <aug>
               <au>
                  <snm>Horrocks</snm>
                  <fnm>I</fnm>
               </au>
               <au>
                  <snm>Patel-Schneider</snm>
                  <fnm>PF</fnm>
               </au>
               <au>
                  <snm>Boley</snm>
                  <fnm>H</fnm>
               </au>
               <au>
                  <snm>Tabet</snm>
                  <fnm>S</fnm>
               </au>
               <au>
                  <snm>Grosof</snm>
                  <fnm>B</fnm>
               </au>
               <au>
                  <snm>Dean</snm>
                  <fnm>M</fnm>
               </au>
            </aug>
            <pubdate>2003</pubdate>
            <url>http://www.daml.org/2003/11/swrl/</url>
         </bibl>
         <bibl id="B45">
            <title>
               <p>Project Nonmonotonic Reasoning</p>
            </title>
            <aug>
               <au>
                  <cnm>The Bio-Ontology Research Group Leipzig</cnm>
               </au>
            </aug>
            <pubdate>2007</pubdate>
            <url>http://bioonto.de/pmwiki.php/Main/NonmonotonicReasoning</url>
         </bibl>
      </refgrp>
   </bm>
</art>
