Computing Boundaries for Reasoning in Sub-Ontologies

From International Center for Computational Logic
Toggle side column

Computing Boundaries for Reasoning in Sub-Ontologies

Franz BaaderFranz Baader,  Martin KnechtelMartin Knechtel,  Rafael PeñalozaRafael Peñaloza
Franz Baader, Martin Knechtel, Rafael Peñaloza
Computing Boundaries for Reasoning in Sub-Ontologies
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, volume 09-02, 2009. LTCS-Report
  • KurzfassungAbstract
    Consider an ontology O where every axiom is labeled with an element of a lattice L. Then every element l of L determines a sub-ontology O_l, which consists of the axioms of O whose labels are greater or equal to l. These labels may be interpreted as required access rights, in which case O_l is the sub-ontology that a user with access right l is allowed to see, or as trust levels, in which case O_l consists of those axioms that we trust with level at least l. Given a consequence C (such as a subsumption relationship between concepts) that follows from the whole ontology O, we want to know from which of the sub-ontologies O_l, determined by lattice elements l, C still follows. However, instead of reasoning with O_l in the deployment phase of the ontology, we want to pre-compute this information during the development phase. More precisely, we want to compute what we call a boundary for C, i.e., an element m_C of L such that C follows from O_l iff l is smaller or equal to m_C. In this paper we show that, under certain restrictions on the elements l used to define the sub-ontologies, such a boundary always exists, and we describe black-box approaches for computing it that are generalizations of approaches for axiom pinpointing in description logics. We also present first experimental results that compare the efficiency of these approaches on real-world ontologies.
  • Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{ BaKP-LTCS-09,
  address = {Germany},
  author = {Franz {Baader} and Martin {Knechtel} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {09-02},
  title = {Computing Boundaries for Reasoning in Sub-Ontologies},
  type = {LTCS-Report},
  year = {2009},
}