Sciweavers

40 search results - page 2 / 8
» Conjunctive Query Answering for Description Logics with Tran...
Sort
View
LPAR
2007
Springer
13 years 11 months ago
Data Complexity in the EL Family of Description Logics
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
Adila Krisnadhi, Carsten Lutz
DLOG
2008
13 years 7 months ago
Two Upper Bounds for Conjunctive Query Answering in SHIQ
We have shown recently that, in extensions of ALC that involve inverse roles, conjunctive query answering is harder than satisfiability: it is 2-ExpTime-complete in general and NEx...
Carsten Lutz
SEMWEB
2009
Springer
13 years 10 months ago
A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL
Scalable query answering over Description Logic (DL) based ontologies plays an important role for the success of the Semantic Web. Towards tackling the scalability problem, we prop...
Jianfeng Du, Guilin Qi, Jeff Z. Pan, Yi-Dong Shen
AAAI
2007
13 years 7 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
TOCL
2008
86views more  TOCL 2008»
13 years 5 months ago
Conjunctive query containment and answering under description logic constraints
Diego Calvanese, Giuseppe De Giacomo, Maurizio Len...