Sciweavers

412 search results - page 59 / 83
» Aggregate queries over ontologies
Sort
View
FOIKS
2006
Springer
14 years 1 months ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov
DKE
2008
172views more  DKE 2008»
13 years 10 months ago
An XML Schema integration and query mechanism system
The availability of large amounts of heterogeneous distributed web data necessitates the integration of XML data from multiple XML sources for many reasons. For example, currently,...
Sanjay Kumar Madria, Kalpdrum Passi, Sourav S. Bho...
WISE
2005
Springer
14 years 3 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
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
13 years 1 months ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 10 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande