Sciweavers

126 search results - page 3 / 26
» The Complexity of Acyclic Conjunctive Queries
Sort
View
DLOG
2006
13 years 9 months ago
Data Complexity of Answering Unions of Conjunctive Queries in SHIQ
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
DLOG
2011
12 years 11 months ago
The Complexity of Conjunctive Query Abduction in DL-Lite
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for DLs, where research focused on the...
Diego Calvanese, Magdalena Ortiz, Mantas Simkus, G...
AAAI
2006
13 years 9 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
ERSHOV
2009
Springer
14 years 2 months ago
On the Containment Problem for Queries in Conjunctive Form with Negation
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
Victor Felea
ICDT
2009
ACM
149views Database» more  ICDT 2009»
14 years 8 months ago
Query languages for data exchange: beyond unions of conjunctive queries
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
Juan Reutter, Marcelo Arenas, Pablo Barceló