Sciweavers

39 search results - page 1 / 8
» Data Complexity of Answering Unions of Conjunctive Queries i...
Sort
View
DLOG
2006
13 years 6 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
IJCAI
2007
13 years 6 months ago
Conjunctive Query Answering for the Description Logic SHIQ
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive quer...
Birte Glimm, Ian Horrocks, Carsten Lutz, Ulrike Sa...
CADE
2008
Springer
14 years 5 months ago
The Complexity of Conjunctive Query Answering in Expressive Description Logics
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...
Carsten Lutz
AAAI
2006
13 years 6 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
ICDT
2009
ACM
149views Database» more  ICDT 2009»
14 years 5 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ó