Reasoning in descriptive logic (DL) ontologies is known to be intractable in the worst-case. This poses a serious problem for the use of DL-based ontologies such as OWL, because in practice, most ontologies have numerous assertions about individuals in the Abox. We propose a technique to make reasoning scalable for very large Aboxes in secondary storage. The technique operates by producing a dramatically reduced summary Abox for the original Abox. Reasoning on the original Abox is reduced in most cases to reason-ing on this reduced summary Abox. We show that our techniques scale to consistency detection on ontologies with 6.5 million role assertions
Many modern applications of description logics (DLs) require answering queries over large data quant...
Benefits from structured knowledge representation have motivated the creation of large description l...
Abstract. We investigate cases where an ontology expressed in a seem-ingly hard DL can be polynomial...
Description logics (DLs) are knowledge representation formalisms with well-understood model-theoreti...
Description logics (DLs), as a decidable fragment of first-order logic, are a family of logic based ...
Acknowledgements This work has been partially supported by the European project Marrying Ontologies ...
We propose a new Description Logic, called DL-Lite, specifically tailored to capture basic ontology ...
Large scale ontology applications require efficient and robust description logic (DL) reasoning serv...
In this paper we investigate the consequence-based algorithms that are nowadays commonly used for su...
Nowadays, saturation-based reasoners for the OWL EL profile of the Web Ontology Language are able to...
State of the art reasoners for expressive description logics, such as those that underpin the OWL on...
In this paper we investigate the consequence-based algorithms that are nowadays commonly used for su...
ABox abduction is an important reasoning mechanism for description logic ontologies. It computes all...
Abstract. Today ontologies are heavily used in the sematic web. As they grow in size reasoning syste...
International audienceReasoning in a Knowledge Base (KB) is one of the most important applications o...
Many modern applications of description logics (DLs) require answering queries over large data quant...
Benefits from structured knowledge representation have motivated the creation of large description l...
Abstract. We investigate cases where an ontology expressed in a seem-ingly hard DL can be polynomial...
Description logics (DLs) are knowledge representation formalisms with well-understood model-theoreti...
Description logics (DLs), as a decidable fragment of first-order logic, are a family of logic based ...
Acknowledgements This work has been partially supported by the European project Marrying Ontologies ...
We propose a new Description Logic, called DL-Lite, specifically tailored to capture basic ontology ...
Large scale ontology applications require efficient and robust description logic (DL) reasoning serv...
In this paper we investigate the consequence-based algorithms that are nowadays commonly used for su...
Nowadays, saturation-based reasoners for the OWL EL profile of the Web Ontology Language are able to...
State of the art reasoners for expressive description logics, such as those that underpin the OWL on...
In this paper we investigate the consequence-based algorithms that are nowadays commonly used for su...
ABox abduction is an important reasoning mechanism for description logic ontologies. It computes all...
Abstract. Today ontologies are heavily used in the sematic web. As they grow in size reasoning syste...
International audienceReasoning in a Knowledge Base (KB) is one of the most important applications o...
Many modern applications of description logics (DLs) require answering queries over large data quant...
Benefits from structured knowledge representation have motivated the creation of large description l...
Abstract. We investigate cases where an ontology expressed in a seem-ingly hard DL can be polynomial...