• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 192
  • Tagged with
  • 192
  • 192
  • 191
  • 187
  • 181
  • 181
  • 181
  • 173
  • 72
  • 70
  • 52
  • 50
  • 46
  • 36
  • 26
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
101

Repairing Description Logic Ontologies by Weakening Axioms

Baader, Franz, Kriegel, Francesco, Nuradiansyah, Adrian, Peñaloza, Rafael 20 June 2022 (has links)
The classical approach for repairing a Description Logic ontology O in the sense of removing an unwanted consequence α is to delete a minimal number of axioms from O such that the resulting ontology O´ does not have the consequence α. However, the complete deletion of axioms may be too rough, in the sense that it may also remove consequences that are actually wanted. To alleviate this problem, we propose a more gentle way of repair in which axioms are not necessarily deleted, but only weakened. On the one hand, we investigate general properties of this gentle repair method. On the other hand, we propose and analyze concrete approaches for weakening axioms expressed in the Description Logic EL.
102

Ontology-Mediated Query Answering for Probabilistic Temporal Data with EL Ontologies: Extended Version

Koopmann, Patrick 20 June 2022 (has links)
Especially in the field of stream reasoning, there is an increased interest in reasoning about temporal data in order to detect situations of interest or complex events. Ontologies have been proved a useful way to infer missing information from incomplete data, or simply to allow for a higher order vocabulary to be used in the event descriptions. Motivated by this, ontology-based temporal query answering has been proposed as a means for the recognition of situations and complex events. But often, the data to be processed do not only contain temporal information, but also probabilistic information, for example because of uncertain sensor measurements. While there has been a plethora of research on ontologybased temporal query answering, only little is known so far about querying temporal probabilistic data using ontologies. This work addresses this problem by introducing a temporal query language that extends a well-investigated temporal query language with probability operators, and investigating the complexity of answering queries using this query language together with ontologies formulated in the description logic EL.
103

Actions with Conjunctive Queries:: Projection, Conflict Detection and Verification

Koopmann, Patrick 20 June 2022 (has links)
Description Logic actions specify adaptations of description logic interpretations based on some preconditions defined using a description logic. We consider DL actions in which preconditions can be specified using DL axioms as well as using conjunctive queries, and combinatiosn thereof. We investigate complexity bounds for the executability and the projection problem for these actions, which respectively ask whether an action can be executed on models of an interpretation, and which entailments are satisfied after an action has been executed on this model. In addition, we consider a set of new reasoning tasks concerned with conflicts and interactions that may arise if two action are executed at the same time. Since these problems have not been investigated before for Description Logic actions, we investigate the complexity of these tasks both for actions with conjunctive queries and without those. Finally, we consider the verification problem for Golog programs formulated over our famility of actions. Our complexity analysis considers several expressive DLs, and we provide tight complexity bounds for those for which the exact complexity of conjunctive query entailment is known.
104

The distributive, graded lattice of EL concept descriptions and its neighborhood relation: Extended Version

Kriegel, Francesco 20 June 2022 (has links)
For the description logic EL, we consider the neighborhood relation which is induced by the subsumption order, and we show that the corresponding lattice of EL concept descriptions is distributive, modular, graded, and metric. In particular, this implies the existence of a rank function as well as the existence of a distance function.
105

Subsumption in Finitely Valued Fuzzy EL

Borgwardt, Stefan, Cerami, Marco, Peñaloza, Rafael 20 June 2022 (has links)
Aus der Einleitung: Description Logics (DLs) are a family of knowledge representation formalisms that are successfully applied in many application domains. They provide the logical foundation for the Direct Semantics of the standard web ontology language OWL2. The light-weight DL EL, underlying the OWL2 EL profile, is of particular interest since all common reasoning problems are polynomial in this logic, and it is used in many prominent biomedical ontologies like SNOMEDCT and the Gene Ontology.
106

LTL over EL Axioms

Borgwardt, Stefan, Thost, Veronika 20 June 2022 (has links)
Aus der Einleitung: Description Logics (DLs) [BCM+07] are popular knowledge representation formalisms, mainly because they are the basis of the standardized OWL 2 Direct Semantics, their expressiveness can be tailored to the application at hand, and many optimized reasoning systems are available.
107

Adding Threshold Concepts to the Description Logic EL

Baader, Franz, Brewka, Gerhard, Gil, Oliver Fernández 20 June 2022 (has links)
We introduce an extension of the lightweight Description Logic EL that allows us to de_ne concepts in an approximate way. For this purpose, we use a graded membership function, which for each individual and concept yields a number in the interval [0, 1] expressing the degree to which the individual belongs to the concept. Threshold concepts C~t for ~ then collect all the individuals that belong to C with degree ~ t. We generalize a well-known characterization of membership in EL concepts to construct a specific graded membership function deg, and investigate the complexity of reasoning in the Description Logic τEL(deg), which extends EL by threshold concepts defined using deg. We also compare the instance problem for threshold concepts of the form C>t in τEL(deg) with the relaxed instance queries of Ecke et al.
108

Verification of Knowledge-Based Programs over Description Logic Actions

Zarrieß, Benjamin, Claßen, Jens 20 June 2022 (has links)
A knowledge-based program defines the behavior of an agent by combining primitive actions, programming constructs and test conditions that make explicit reference to the agent’s knowledge. In this paper we consider a setting where an agent is equipped with a Description Logic (DL) knowledge base providing general domain knowledge and an incomplete description of the initial situation. We introduce a corresponding new DL-based action language that allows for representing both physical and sensing actions, and that we then use to build knowledge-based programs with test conditions expressed in the epistemic DL. After proving undecidability for the general case, we then discuss a restricted fragment where verification becomes decidable. The provided proof is constructive and comes with an upper bound on the procedure’s complexity.
109

A Tableau Algorithm for SROIQ under Infinitely Valued Gödel Semantics

Borgwardt, Stefan, Peñaloza, Rafael 20 June 2022 (has links)
Fuzzy description logics (FDLs) are knowledge representation formalisms capable of dealing with imprecise knowledge by allowing intermediate membership degrees in the interpretation of concepts and roles. One option for dealing with these intermediate degrees is to use the so-called Gödel semantics. Despite its apparent simplicity, developing reasoning techniques for expressive FDLs under this semantics is a hard task. We present a tableau algorithm for deciding consistency of a SROIQ ontology under Gödel semantics. This is the first algorithm that can handle the full expressivity of SROIQ as well as the full Gödel semantics.
110

Extending the Description Logic τEL(deg) with Acyclic TBoxes

Baader, Franz, Gil, Oliver Fernández 20 June 2022 (has links)
In a previous paper, we have introduced an extension of the lightweight Description Logic EL that allows us to define concepts in an approximate way. For this purpose, we have defined a graded membership function deg, which for each individual and concept yields a number in the interval [0; 1] expressing the degree to which the individual belongs to the concept. Threshold concepts C~t for ~ 2 ∈ {<, ≤, >, ≥} then collect all the individuals that belong to C with degree ~ t. We have then investigated the complexity of reasoning in the Description Logic τEL(deg), which is obtained from EL by adding such threshold concepts. In the present paper, we extend these results, which were obtained for reasoning without TBoxes, to the case of reasoning w.r.t. acyclic TBoxes. Surprisingly, this is not as easy as might have been expected. On the one hand, one must be quite careful to define acyclic TBoxes such that they still just introduce abbreviations for complex concepts, and thus can be unfolded. On the other hand, it turns out that, in contrast to the case of EL, adding acyclic TBoxes to τEL(deg) increases the complexity of reasoning by at least on level of the polynomial hierarchy.

Page generated in 0.0596 seconds