138 research outputs found
A KLM Perspective on Defeasible Reasoning for Description Logics
In this paper we present an approach to defeasible reasoning for the description logic ALC. The results discussed here are based on work done by Kraus, Lehmann and Magidor (KLM) on defeasible conditionals in the propositional case. We consider versions of a preferential semantics for two forms of defeasible subsumption, and link these semantic constructions formally to KLM-style syntactic properties via representation results. In addition to showing that the semantics is appropriate, these results pave the way for more effective decision procedures for defeasible reasoning in description logics. With the semantics of the defeasible version of ALC in place, we turn to the investigation of an appropriate form of defeasible entailment for this enriched version of ALC. This investigation includes an algorithm for the computation of a form of defeasible entailment known as rational closure in the propositional case. Importantly, the algorithm relies completely on classical entailment checks and shows that the computational complexity of reasoning over defeasible ontologies is no worse than that of the underlying classical ALC. Before concluding, we take a brief tour of some existing work on defeasible extensions of ALC that go beyond defeasible subsumption
On the KLM properties of a fuzzy DL with Typicality
The paper investigates the properties of a fuzzy logic of typicality. The
extension of fuzzy logic with a typicality operator was proposed in recent work
to define a fuzzy multipreference semantics for Multilayer Perceptrons, by
regarding the deep neural network as a conditional knowledge base. In this
paper, we study its properties. First, a monotonic extension of a fuzzy ALC
with typicality is considered (called ALC^FT) and a reformulation the KLM
properties of a preferential consequence relation for this logic is devised.
Most of the properties are satisfied, depending on the reformulation and on the
fuzzy combination functions considered. We then strengthen ALC^FT with a
closure construction by introducing a notion of faithful model of a weighted
knowledge base, which generalizes the notion of coherent model of a conditional
knowledge base previously introduced, and we study its properties.Comment: 15 page
An alternative proof method for possibilistic logic and its application to terminological logics
Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree or a necessity degree that expresses to what extent the formula is possibly or necessarily true. Possibilistic resolution, an extension of the well-known resolution principle, yields a calculus for possibilistic logic which respects the semantics developed for possibilistic logic. A drawback, which possibilistic resolution inherits from classical resolution, is that it may not terminate if applied to formulas belonging to decidable fragments of first-order logic. Therefore we propose an alternative proof method for possibilistic logic. The main feature of this method is that it completely abstracts from a concrete calculus but uses as basic operation a test for classical entailment. If this test is decidable for some fragment of first-order logic then possibilistic reasoning is also decidable for this fragment. We then instantiate possibilistic logic with a terminological logic, which is a decidable subclass of first-order logic but nevertheless much more expressive than propositional logic. This yields an extension of terminological logics towards the representation of uncertain knowledge which is satisfactory from a semantic as well as algorithmic point of view
Rational Defeasible Reasoning for Description Logics
In this paper, we extend description logics (DLs) with non-monotonic reasoning fea- tures. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus and colleagues in the propositional case. In particular, we consider a natural and intuitive semantics for defeasible subsumption, and we investi- gate syntactic properties (à la Gentzen) for both preferential and rational subsumptions and prove representation results for the description logic ALC. Such representation results pave the way for more effective decision procedures for defeasible reasoning in DLs. We analyse the problem of non-monotonic reasoning in DL at the level of entailment for both TBox and ABox reasoning, and present an adaptation of rational closure for the DL en- vironment. Importantly, we also show that computing it can be reduced to classical ALC entailment. One of the stumbling blocks to evaluating performance scalability of rational closure is the absence of naturally occurring DL-based ontologies with defeasible features. We overcome this barrier by devising an approach to introduce defeasible subsumption into classical real-world ontologies. Such semi-natural defeasible ontologies, together with a purely artificial set, are used to test our rational closure algorithms. We found that performance is scalable on the whole with no major bottlenecks
A Description Logic Framework for Commonsense Conceptual Combination Integrating Typicality, Probabilities and Cognitive Heuristics
We propose a nonmonotonic Description Logic of typicality able to account for
the phenomenon of concept combination of prototypical concepts. The proposed
logic relies on the logic of typicality ALC TR, whose semantics is based on the
notion of rational closure, as well as on the distributed semantics of
probabilistic Description Logics, and is equipped with a cognitive heuristic
used by humans for concept composition. We first extend the logic of typicality
ALC TR by typicality inclusions whose intuitive meaning is that "there is
probability p about the fact that typical Cs are Ds". As in the distributed
semantics, we define different scenarios containing only some typicality
inclusions, each one having a suitable probability. We then focus on those
scenarios whose probabilities belong to a given and fixed range, and we exploit
such scenarios in order to ascribe typical properties to a concept C obtained
as the combination of two prototypical concepts. We also show that reasoning in
the proposed Description Logic is EXPTIME-complete as for the underlying ALC.Comment: 39 pages, 3 figure
On rational entailment for Propositional Typicality Logic
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 decision problem under RC for nominal safe ELO⊥, a notable and practically important DL representative of the OWL 2 profile OWL 2 EL. Our contribution here is to define a polynomial time subsumption procedure for nominal safe ELO⊥ under RC that relies entirely on a series of classical, monotonic EL⊥ subsumption tests. Therefore, any existing classical monotonic EL⊥ reasoner can be used as a black box to implement our method. We then also adapt the method to one of the known extensions of RC for DLs, namely Defeasible Inheritance-based DLs without losing the computational tractability
- …