The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Characterizing data complexity for conjunctive query answering in expressive description logics
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Approximating OWL-DL ontologies
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Conjunctive query answering for the description logic SHIQ
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conjunctive query answering in the description logic EL using a relational database system
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Efficient Query Answering for OWL 2
ISWC '09 Proceedings of the 8th International Semantic Web Conference
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
Finding all justifications of OWL DL entailments
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Journal on data semantics X
Resolution-Based approximate reasoning for OWL DL
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Repairing ontologies for incomplete reasoners
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
What to ask to an incomplete semantic web reasoner?
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
| Hi-index | 0.00 |
We extend our recent work on evaluating incomplete reasoners by introducing strict testing bases.We show how they can be used in practice to identify ontologies and queries where applications can exploit highly scalable incomplete query answering systems while enjoying completeness guarantees normally available only when using computationally intensive reasoning systems.