63 research outputs found
Syntactic vs. Semantic Locality: How Good Is a Cheap Approximation?
Extracting a subset of a given OWL ontology that captures all the ontology's
knowledge about a specified set of terms is a well-understood task. This task
can be based, for instance, on locality-based modules (LBMs). These come in two
flavours, syntactic and semantic, and a syntactic LBM is known to contain the
corresponding semantic LBM. For syntactic LBMs, polynomial extraction
algorithms are known, implemented in the OWL API, and being used. In contrast,
extracting semantic LBMs involves reasoning, which is intractable for OWL 2 DL,
and these algorithms had not been implemented yet for expressive ontology
languages. We present the first implementation of semantic LBMs and report on
experiments that compare them with syntactic LBMs extracted from real-life
ontologies. Our study reveals whether semantic LBMs are worth the additional
extraction effort, compared with syntactic LBMs
TBox Reasoning in the Probabilistic Description Logic SHIQ P
Abstract. One shortcoming of classic Descriptions Logics, DLs, is their inability to encode probabilistic knowledge and reason over it. This is, however, a strong demand of some modern applications, e.g. in biology and healthcare. Therefore, probabilistic extensions of DLs are attracting attention nowadays. We introduce the probabilistic DL SHIQP which extends a known probabilistic DL. We investigate two reasoning problems for TBoxes: deciding consistency and computing tight probability bounds. It turns out that both problems are not harder than reasoning in the classic counterpart SHIQ. We gain insight into complexity sources
A survey of current, stand-alone OWL Reasoners
Abstract. We present a survey of the current OWL reasoner landscape. Through literature and web search we have identified 35 OWL reasoners that are, at least to some degree, actively maintained. We conducted a survey directly addressing the respective developers, and collected 33 responses. We present an analysis of the survey, characterising all reasoners across a wide range of categories such as supported expressiveness and reasoning services. We will also provide some insight about ongoing research efforts and a rough categorisation of reasoner calculi
Principles of KLM-style Defeasible Description Logics
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 extensions of description logics, with a significant number of these, in turn, following the so-called KLM approach to defeasible reasoning initially advocated for propositional logic by Kraus, Lehmann, and Magidor. Each of these attempts has its own aim of investigating particular constructions and variants of the (KLM-style) preferential approach. Here our aim is to provide a comprehensive study of the formal foundations of preferential defeasible reasoning for description logics in the KLM tradition.
We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann, and Magidor in the propositional case. In particular, we consider a natural and intuitive semantics for defeasible subsumption, and we investigate KLM-style syntactic properties for both preferen- tial and rational subsumption. Our contribution includes two representation results linking our semantic constructions to the set of preferential and rational properties considered. Besides showing that our seman- tics is appropriate, these results pave the way for more effective decision procedures for defeasible reasoning in description logics. Indeed, we also analyse the problem of non-monotonic reasoning in description logics at the level of entailment and present an algorithm for the computation of rational closure of a defeasible knowledge base. Importantly, our algorithm relies completely on classical entailment and shows that the computational complexity of reasoning over defeasible knowledge bases is no worse than that of reasoning in the underlying classical DL ALC
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
TBox Reasoning in the Probabilistic Description Logic SHIQp
Abstract. One shortcoming of classic Descriptions Logics, DLs, is their inability to encode probabilistic knowledge and reason over it. This is, however, a strong demand of some modern applications, e.g. in biology and healthcare. Therefore, probabilistic extensions of DLs are attracting attention nowadays. We introduce the probabilistic DL SHIQP which extends a known probabilistic DL. We in-vestigate two reasoning problems for TBoxes: deciding consistency and com-puting tight probability bounds. It turns out that both problems are not harder than reasoning in the classic counterpart SHIQ. We gain insight into complex-ity sources.
- …