Sciweavers

42 search results - page 1 / 9
» Data Complexity of Query Answering in Expressive Description...
Sort
View
JAR
2008
77views more  JAR 2008»
13 years 4 months ago
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
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
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
OTM
2007
Springer
13 years 11 months ago
Parallelizing Tableaux-Based Description Logic Reasoning
Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL ta...
Thorsten Liebig, Felix Müller
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...