-
21
Role Conjunctions in Expressive Description Logics
Published 2008“…We show that adding role conjunctions to the Description Logics (DLs) SHI and SHOIF causes a jump in the computational complexity of the standard reasoning tasks from ExpTime-complete to 2ExpTime-complete and from NExpTime-complete to N2ExpTime-hard respectively. …”
Conference item -
22
Stratified Probabilistic Description Logic Programs
Published 2005“…<p>In previous work, we have introduced probabilistic description logic programs (or pdl-programs), which are a combination of description logic programs (or dl-programs) under the answer set and well-founded semantics with Poole's independent choice logic. …”
Conference item -
23
Tractable Probabilistic Description Logic Programs
Published 2013“…<p>We propose tractable probabilistic description logic programs (dl-programs) for the Semantic Web, which combine tractable description logics (DLs), normal programs under the answer set and the well-founded semantics, and probabilities. …”
Book section -
24
Individual Reuse in Description Logic Reasoning.
Published 2008“…Tableau calculi are the state-of-the-art for reasoning in description logics (DL). Despite recent improvements, tableau-based reasoners still cannot process certain knowledge bases (KBs), mainly because they end up building very large models. …”
Journal article -
25
-
26
-
27
-
28
-
29
-
30
-
31
Plausible Description Logic Programs for Stream Reasoning
Published 2012-10-01Subjects: Get full text
Article -
32
-
33
On the Semantic Relationship between Datalog and Description Logics.
Published 2010“…Translations to (first-order) datalog have been used in a number of inferencing techniques for description logics (DLs), yet the relationship between the semantic expressivities of function-free Horn logic and DL is understood only poorly. …”
Journal article -
34
Ideal Downward Refinement in the EL Description Logic
Published 2009“…With the proliferation of the Semantic Web, there has been a rapidly rising interest in description logics, which form the logical foundation of the W3C standard ontology language OWL. …”
Conference item -
35
-
36
Consequence-based reasoning for the Description Logic SROIQ
Published 2019“…<p>Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi to solve the problem of ontology classification in Description Logics (DLs). Existing CB reasoners, however, are only capable of handling DLs without nominals (such as SRIQ), or DLs without disjunction (such as Horn-SROIQ). …”
Thesis -
37
Nominal Schemas for Integrating Rules and Description Logics.
Published 2011“…This feature allows us to express arbitrary DL-safe rules in description logic syntax. We show that adding nominal schemas to SROIQ does not increase its worst-case reasoning complexity, and we identify a family of tractable DLs SROELVn that allow for restricted use of nominal schemas.…”
Journal article -
38
-
39
Combining Description Logics, Description Graphs, and Rules.
Published 2010“…Recent practical experience with description logics (DLs) has revealed that their expressivity is often insufficient to accurately describe structured objects-objects whose parts are interconnected in arbitrary, rather than tree-like ways. …”
Journal article -
40