Sciweavers

95 search results - page 3 / 19
» The Complexity of Conjunctive Query Answering in Expressive ...
Sort
View
JAPLL
2010
179views more  JAPLL 2010»
13 years 6 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
DLOG
2011
12 years 11 months ago
Query Answering over SROIQ Knowledge Bases with SPARQL
W3C currently extends the SPARQL query language with so-called entailment regimes, which define how queries are evaluated using logical entailment relations. We describe a sound a...
Ilianna Kollia, Birte Glimm, Ian Horrocks
TOCL
2008
86views more  TOCL 2008»
13 years 7 months ago
Conjunctive query containment and answering under description logic constraints
Diego Calvanese, Giuseppe De Giacomo, Maurizio Len...
PODS
1998
ACM
116views Database» more  PODS 1998»
13 years 12 months ago
Complexity of Answering Queries Using Materialized Views
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
Serge Abiteboul, Oliver M. Duschka
AAAI
2000
13 years 9 months ago
A Conjunctive Query Language for Description Logic Aboxes
A serious shortcoming of many Description Logic based knowledge representation systems is the inadequacy of their query languages. In this paper we present a novel technique that ...
Ian Horrocks, Sergio Tessaris