On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Conjunctive Query Language for Description Logic Aboxes
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Reasoning with Individuals for the Description Logic SHIQ
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Journal of Automated Reasoning
On the Scalability of Description Logic Instance Retrieval
Journal of Automated Reasoning
Scalable Grounded Conjunctive Query Evaluation over Large and Expressive Knowledge Bases
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Conjunctive query answering for the description logic SHIQ
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A tableaux decision procedure for SHOIQ
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
Reducing OWL entailment to description logic satisfiability
Web Semantics: Science, Services and Agents on the World Wide Web
Towards a complete OWL ontology benchmark
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
| Hi-index | 0.00 |
Conjunctive query answering is becoming a very important task on the Semantic Web as the adoption of SPARQL query language increases. There is considerable work done in the area of optimizing conjunctive query answering for RDF and OWL2-DL ontologies, in the latter case namely for queries without undistinguished variables. However, there has not been much emphasis on how to handle queries with both distinguished and undistinguished variables efficiently. In this paper, we present a novel algorithm for answering conjunctive queries over OWL2- DL ontologies with undistinguished variables efficiently. These optimizations are implemented in the Pellet query engine and our experimental evaluation shows that the new optimization improves the query performance significantly.