Reasoning with Individuals for the Description Logic SHIQ
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Scalable semantic retrieval through summarization and refinement
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Conjunctive query answering for the description logic SHIQ
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Towards a complete OWL ontology benchmark
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
The summary abox: cutting ontologies down to size
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Conjunctive query optimization in OWL2-DL
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Polynomial conjunctive query rewriting under unary inclusion dependencies
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Query rewriting for inconsistent DL-lite ontologies
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
The combined approach to ontology-based data access
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Ontology-based data access with databases: a short course
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.00 |
Grounded conjunctive query answering over OWL-DL ontologies is intractable in the worst case, but we present novel techniques which allow for efficient querying of large expressive knowledge bases in secondary storage. In particular, we show that we can effectively answer grounded conjunctive queries without building a full completion forest for a large Abox (unlike state of the art tableau reasoners). Instead we rely on the completion forest of a dramatically reduced summary of the Abox. We demonstrate the effectiveness of this approach in Aboxes with up to 45 million assertions.