Advertisement

Distance-Based Ranking of Negative Answers

  • Jianfeng DuEmail author
  • Can Lin
  • Kunxun Qi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9544)

Abstract

Suggesting negative answers to users is a solution to the problem of insufficiently many answers in conjunctive query answering over description logic (DL) ontologies. Negative answers are complementary to certain answers and have explanations in the given ontology. Before being suggested to users, negative answers need to be ranked. However, there is no method for ranking negative answers by now. To fill this gap, this paper studies ranking methods that require only information on the given query and the given ontology. Three distance-based methods are proposed. Experimental results demonstrate that these methods can effectively rank negative answers to those conjunctive queries that have certain answers in the given DL ontology.

Keywords

Description Logic Ranking Method Negative Answer Conjunctive Query Relevance Degree 
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.

Notes

Acknowledgements

This work is partly supported by NSFC (61375056) and Guangdong Natural Science Foundation (S2013010012928).

References

  1. 1.
    Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)zbMATHGoogle Scholar
  2. 2.
    Borgida, A., Calvanese, D., Rodriguez-Muro, M.: Explanation in the DL \(-\) Lite family of description logics. In: Tari, Z., Meersman, R. (eds.) OTM 2008, Part II. LNCS, vol. 5332, pp. 1440–1457. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. J. Web Sem. 14, 57–83 (2012)CrossRefGoogle Scholar
  4. 4.
    Calvanese, D., Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning 39(3), 385–429 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Calvanese, D., Ortiz, M., Simkus, M., Stefanoni, G.: Reasoning about explanations for negative query answers in DL-Lite. J. Artif. Intell. Res. 48, 635–669 (2013)MathSciNetzbMATHGoogle Scholar
  6. 6.
    d’Amato, C., Fanizzi, N., Esposito, F.: Query answering and ontology population: an inductive approach. In: Bechhofer, S., Hauswirth, M., Hoffmann, J., Koubarakis, M. (eds.) ESWC 2008. LNCS, vol. 5021, pp. 288–302. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Du, J., Liu, D., Lin, C., Zhou, X., Liang, J.: A system for tractable computation of negative answers to conjunctive queries. In: Zhao, D., Du, J., Wang, H., Wang, P., Ji, D., Pan, J.Z. (eds.) CSWS 2014. CCIS, vol. 480, pp. 56–66. Springer, Heidelberg (2014)Google Scholar
  8. 8.
    Du, J., Pan, J.Z.: A system for tractable computation of negative answers to conjunctive queries. In: ISWC, pp. 339–355 (2015)Google Scholar
  9. 9.
    Grau, B.C., Motik, B., Stoilos, G., Horrocks, I.: Completeness guarantees for incomplete ontology reasoners: Theory and practice. J. Artif. Intell. Res. 43, 419–476 (2012)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Guangdong University of Foreign StudiesGuangzhouChina

Personalised recommendations