Sciweavers

93 search results - page 11 / 19
» Pellet: An OWL DL Reasoner
Sort
View
WISE
2005
Springer
14 years 1 months ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
OTM
2007
Springer
14 years 1 months ago
Parallelizing Tableaux-Based Description Logic Reasoning
Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL ta...
Thorsten Liebig, Felix Müller
ESWS
2007
Springer
14 years 1 months ago
Algorithms for Paraconsistent Reasoning with OWL
In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuraci...
Yue Ma, Pascal Hitzler, Zuoquan Lin
OWLED
2007
13 years 9 months ago
An Extension of DIG 2.0 for Handling Bulk Data
The research community has noted the need to retrieve the instance level of an ontology from bulk data stored in external data sources (e.g., a relational database), in order to de...
Diego Calvanese, Mariano Rodriguez-Muro
AAAI
2010
13 years 9 months ago
Soundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
Yuan Ren, Jeff Z. Pan, Yuting Zhao