In this paper we provide a semantic reconstruction of rational closure. We first consider
rational closure as defined by Lehman and Magidor [33] for propositional logic, and we …

In this paper we propose a non-monotonic extension of the Description Logic ALC for
reasoning about prototypical properties and inheritance with exceptions. The resulting logic …

The past 25 years have seen many attempts to introduce defeasible-reasoning capabilities
into a description logic setting. Many, if not most, of these attempts are based on preferential …

Defeasible inheritance networks are a non-monotonic framework that deals with hierarchical
knowledge. On the other hand, rational closure is acknowledged as a landmark of the …

Among the various proposals for defeasible reasoning for description logics, Rational
Closure, a procedure originally defined for propositional logic, turns out to have a number of …

Rational closure is one of the most extensively studied nonmonotonic extensions of
description logics. Nonetheless, so far it has been investigated only for description logics …

Abstract Description Logics (DLs) under Rational Closure (RC) is a well-known framework
for non-monotonic reasoning in DLs. In this paper, we address the concept subsumption …

The introduction of defeasible reasoning in Description Logics has been a main research
topic in the field in the last years. Despite the fact that various interesting formalizations of …

Abstract Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by
enriching classical propositional logic with a typicality operator. In spite of the non …

Abstract Description logics have been extended in a number of ways to support defeasible
reasoning in the KLM tradition. Such features include preferential or rational defeasible …