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. © 2010 Springer-Verlag.
CITATION STYLE
Stoilos, G., Cuenca Grau, B., & Horrocks, I. (2010). Completeness guarantees for incomplete reasoners. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6496 LNCS, pp. 747–763). Springer Verlag. https://doi.org/10.1007/978-3-642-17746-0_47
Mendeley helps you to discover research relevant for your work.