Sciweavers

11 search results - page 1 / 3
» Worst-case Optimal Conjunctive Query Answering for an Expres...
Sort
View
AAAI
2008
13 years 6 months ago
Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...
Magdalena Ortiz, Mantas Simkus, Thomas Eiter
CADE
2008
Springer
14 years 4 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 5 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
DLOG
2006
13 years 5 months ago
Conjunctive Query Answering for Description Logics with Transitive Roles
An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we present algorithms for conjunctive query answerin...
Birte Glimm, Ian Horrocks, Ulrike Sattler
IJCAI
2007
13 years 5 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...