Skip to main content
SpringerLink
Log in
Book cover

Joint International Semantic Technology Conference

JIST 2015: Semantic Technology pp 280–288Cite as

Distance-Based Ranking of Negative Answers

  • Conference paper
  • First Online:

  • 730 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    http://www.cs.put.poznan.pl/alawrynowicz/semintec.htm.

  2. 2.

    http://swat.cse.lehigh.edu/projects/lubm/.

  3. 3.

    https://code.google.com/p/sygenia/.

References

  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)

    MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. 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. 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)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

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

Author information

Authors and Affiliations

  1. Guangdong University of Foreign Studies, Guangzhou, 510006, China

    Jianfeng Du, Can Lin & Kunxun Qi

Authors
  1. Jianfeng Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Can Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kunxun Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianfeng Du .

Editor information

Editors and Affiliations

  1. Southeast University, Nanjing, China

    Guilin Qi

  2. Osaka University, Ibaraki, Japan

    Kouji Kozaki

  3. The University of Aberdeen, Aberdeen, United Kingdom

    Jeff Z. Pan

  4. Zhongnan Hospital of Wuhan University, Wuhan, China

    Siwei Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Du, J., Lin, C., Qi, K. (2016). Distance-Based Ranking of Negative Answers. In: Qi, G., Kozaki, K., Pan, J., Yu, S. (eds) Semantic Technology. JIST 2015. Lecture Notes in Computer Science(), vol 9544. Springer, Cham. https://doi.org/10.1007/978-3-319-31676-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-31676-5_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-31675-8

  • Online ISBN: 978-3-319-31676-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation