On Rational Closure in Description Logics of Typicality release_7t2qzzlyojcxzczfs65gex2d6a

by Laura Giordano and Valentina Gliozzi and Nicola Olivetti and Gian Luca Pozzato

Released as a article .

2013  

Abstract

We define the notion of rational closure in the context of Description Logics extended with a tipicality operator. We start from ALC+T, an extension of ALC with a typicality operator T: intuitively allowing to express concepts of the form T(C), meant to select the "most normal" instances of a concept C. The semantics we consider is based on rational model. But we further restrict the semantics to minimal models, that is to say, to models that minimise the rank of domain elements. We show that this semantics captures exactly a notion of rational closure which is a natural extension to Description Logics of Lehmann and Magidor's original one. We also extend the notion of rational closure to the Abox component. We provide an ExpTime algorithm for computing the rational closure of an Abox and we show that it is sound and complete with respect to the minimal model semantics.
In text/plain format

Archived Files and Locations

application/pdf  154.9 kB
file_hmz7g7qxjnck5mbol3vur2botu
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2013-05-05
Version   v1
Language   en ?
arXiv  1305.1060v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 41f2c2a7-f76a-43a6-b255-43ad8319e64d
API URL: JSON