Description Logics for Relative Terminologies

  • Szymon Klarman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6211)

Abstract

Context-sensitivity has been for long a subject of study in linguistics, logic and computer science. Recently the problem of reasoning with contextual knowledge has been picked up also by the Semantic Web community. In this paper we introduce a conservative extension to the Description Logic \(\mathcal{ALC}\) which supports representation of ontologies containing relative terms, such as ‘big’ or ‘tall’, whose meaning depends on the choice of a particular comparison class (context). We define the language and investigate its computational properties, including the specification of a tableau-based decision procedure and complexity bounds.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Szymon Klarman
    • 1
  1. 1.Department of Computer ScienceVrije Universiteit AmsterdamAmsterdamThe Netherlands

Personalised recommendations