pith. sign in

arxiv: 1807.02879 · v1 · pith:QFBR6GB5new · submitted 2018-07-08 · 💻 cs.AI

Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure

classification 💻 cs.AI
keywords closureexceptionsreasoningskepticalapproachdescriptionlogicsontologies
0
0 comments X
read the original abstract

Reasoning about exceptions in ontologies is nowadays one of the challenges the description logics community is facing. The paper describes a preferential approach for dealing with exceptions in Description Logics, based on the rational closure. The rational closure has the merit of providing a simple and efficient approach for reasoning with exceptions, but it does not allow independent handling of the inheritance of different defeasible properties of concepts. In this work we outline a possible solution to this problem by introducing a variant of the lexicographical closure, that we call skeptical closure, which requires to construct a single base. We develop a bi-preference semantics semantics for defining a characterization of the skeptical closure.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.