Advertisement

Completeness Guarantees for Incomplete Reasoners

  • Giorgos Stoilos
  • Bernardo Cuenca Grau
  • Ian Horrocks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6496)

Abstract

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.

Keywords

Description Logic Testing Unit Conjunctive Query Atomic Concept Strict Testing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Baader, F., McGuinness, D., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook: Theory, implementation and applications. Cambridge Uni. Press, New York (2002)MATHGoogle Scholar
  2. 2.
    Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3), 385–429 (2007)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic \(\mathcal{SHIQ}\). In: Proc. of IJCAI 2007 (2007)Google Scholar
  4. 4.
    Guo, Y., Pan, Z., Heflin, J.: LUBM: A Benchmark for OWL Knowledge Base Systems. Journal of Web Semantics 3(2), 158–182 (2005)CrossRefGoogle Scholar
  5. 5.
    Hitzler, P., Vrandecic, D.: Resolution-based approximate reasoning for OWL DL. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 383–397. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Kalyanpur, A., Parsia, B., Horridge, M., Sirin, E.: Finding all justifications of OWL DL entailments. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L.J.B., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., Cudré-Mauroux, P. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol. 4825, pp. 267–280. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic \(\mathcal{EL}\) using a relational database system. In: Proc. of IJCAI 2009 (2009)Google Scholar
  8. 8.
    Lutz, C., Wolter, F.: Conservative extensions in the lightweight description logic \(\mathcal{EL}\). In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 84–99. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Ortiz, M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: Proc. of AAAI 2006 (2006)Google Scholar
  10. 10.
    Pan, J.Z., Thomas, E.: Approximating OWL-DL Ontologies. In: Proc. of AAAI 2007, pp. 1434–1439 (2007)Google Scholar
  11. 11.
    Pérez-Urbina, H., Horrocks, I., Motik, B.: Efficient query answering for OWL 2. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 489–504. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  12. 12.
    Poggi, A., Lembo, D., Calvanese, D., Giacomo, G.D., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semantics 10, 133–173 (2008)MATHGoogle Scholar
  13. 13.
    Stoilos, G., Cuenca Grau, B., Horrocks, I.: How incomplete is your semantic web reasoner? In: Proc. of AAAI 2010 (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Giorgos Stoilos
    • 1
  • Bernardo Cuenca Grau
    • 1
  • Ian Horrocks
    • 1
  1. 1.Computing LaboratoryOxford UniversityOxfordUK

Personalised recommendations