Sciweavers

19 search results - page 2 / 4
» Optimizing TBox and ABox Reasoning with Pseudo Models
Sort
View
DLOG
2001
13 years 6 months ago
Optimizing Reasoning in Description Logics with Qualified Number Restrictions
In this extended abstract an optimization technique, the so-called signature calculus, for reasoning with number restrictions in description logics is investigated. The calculus i...
Volker Haarslev, Ralf Möller
DLOG
2007
13 years 7 months ago
Optimizing Tableau Reasoning in ALC Extended with Uncertainty
Abstract. There has been an increased interest in recent years to incorporate uncertainty in Description Logics (DLs), and a number of proposals have been put forward for modeling ...
Volker Haarslev, Hsueh-Ieng Pai, Nematollaah Shiri
DLOG
2011
12 years 8 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese
WISE
2005
Springer
13 years 10 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
DLOG
2001
13 years 6 months ago
Combining Tableaux and Algebraic Methods for Reasoning with Qualified Number Restrictions
This paper investigates an optimization technique for reasoning with qualified number restrictions in the description logic ALCQHR+ . We present a hybrid architecture where a stan...
Volker Haarslev, Martina Timmann, Ralf Möller