Description logic programs under probabilistic uncertainty and fuzzy vagueness by Lukasiewicz, T, Straccia, U

“…More concretely, we present probabilistic fuzzy description logic programs, which combine fuzzy description logics, fuzzy logic programs (with stratified default-negation), and probabilistic uncertainty in a uniform framework for the Semantic Web. …”

A metamodel specification tool based on description logic and XML-DATA by Christophe Nicolle

“…Keywords: Cooperation, extensibility, metamodel, translators, description logic, xml-data.…”
Get full text

Incorporating generalized quantifiers into description logic for representing data source contents

Get full text

A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes. by Motik, B, Sattler, U

“…Many modern applications of description logics (DLs) require answering queries over large data quantities, structured according to relatively simple ontologies. …”

Computing Datalog Rewritings for Disjunctive Datalog Programs and Description Logic Ontologies by Kaminski, M, Nenov, Y, Grau, B

Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings by Lukasiewicz, T, Predoiu, L, Stuckenschmidt, H

“…Furthermore, we explore the semantic and computational aspects of probabilistic description logic programs under the well-founded semantics. …”

Computing datalog rewritings for disjunctive datalog programs and description logic ontologies by Kaminski, M, Nenov, Y, Cuenca Grau, B

Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings. by Calì, A, Lukasiewicz, T, Predoiu, L, Stuckenschmidt, H

“…We analyze the requirements for such a formalism, and we propose a novel approach to probabilistic description logic programs as such a formalism, which tightly combines disjunctive logic programs under the answer set semantics with both description logics and Bayesian probabilities. …”

Rewriting Conjunctive Queries under Description Logic Constraints (Technical Report) by Pérez−Urbina, H, Motik, B, Horrocks, I

Consequence-based reasoning for description logics with disjunction, inverse roles, and nominals by Cucala, D, Cuenca Grau, B, Horrocks, I

“…We present a consequence-based calculus for the SHOI description logic. Known consequence-based reasoning procedures are either restricted to logics without nominals (e.g. …”

Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings by Calì, A, Lukasiewicz, T, Predoiu, L, Stuckenschmidt, H

“…We analyze the requirements for such a formalism, and we propose a novel approach to probabilistic description logic programs as such a formalism, which tightly combines disjunctive logic programs under the answer set semantics with both description logics and Bayesian probabilities. …”

Computing Datalog Rewritings for Disjunctive Datalog Programs and Description Logic Ontologies by Kaminski, M, Nenov, Y, Grau, B

Description Logic Reasoning with Decision Diagrams: Compiling SHIQ to Disjunctive Datalog. by Rudolph, S, Krötzsch, M, Hitzler, P

“…We propose a novel method for reasoning in the description logic . After a satisfiability preserving transformation from to the description logic , the obtained Tbox is converted into an ordered binary decision diagram (OBDD) which represents a canonical model for . …”

Pay-as-you-go consequence-based reasoning for the description logic SROIQ by Tena Cucala, D, Cuenca Grau, B, Horrocks, I

“…Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi for solving key reasoning problems in Description Logics (DLs), such as ontology classification. …”

Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes by Haase, C, Lutz, C

“…We perform an exhaustive study of the complexity of subsumption in the EL family of lightweight description logics w.r.t. acyclic and cyclic TBoxes. It turns out that there are interesting members of this family for which subsumption w.r.t. cyclic TBoxes is tractable, whereas it is EXPTIME-complete w.r.t. general TBoxes. …”

Probabilistic Description Logic Programs under Inheritance with Overriding for the Semantic Web by Lukasiewicz, T

“…<p>Towards uncertainty reasoning in the Rules, Logic, and Proof layers of the Semantic Web, we present a novel approach to probabilistic description logic programs, which combine probabilistic logic programs, probabilistic default theories, and the description logics behind OWL Lite and OWL DL. …”

Fuzzy extensions of OWL: Logical properties and reduction to fuzzy description logics by Stamou, J

“…OWL is based on Description Logics which is a popular knowledge representation formalism. …”

(Non−)Succinctness of Uniform Interpolants of General Terminologies in the Description Logic EL by Nikitina, N, Rudolph, S

Efficient Upper Bound Computation of Query Answers in Expressive Description Logics by Zhou, Y, Grau, B, Horrocks, I

Tightly integrated probabilistic description logic programs for representing ontology mappings. by Lukasiewicz, T, Predoiu, L, Stuckenschmidt, H

“…Furthermore, we explore the semantic and computational aspects of probabilistic description logic programs under the well-founded semantics. …”