Advertisement

A System for Tractable Computation of Negative Answers to Conjunctive Queries

  • Jianfeng DuEmail author
  • Deqian Liu
  • Can Lin
  • Xuzhi Zhou
  • Jiaqi Liang
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 480)

Abstract

Users of conjunctive query answering (CQA) in description logic (DL) ontologies may often confront a problem that there are insufficiently many or even no certain answers to a given conjunctive query (CQ). It is needed to suggest users negative answers to a given CQ that are expected to be in the result but actually do not occur there while explaining why these answers are not certain ones. To this end, we develop a system which incrementally computes negative answers in a user interactive mode for a given CQ and a given consistent DL ontology. A negative answer that is incrementally computed in level \(k\) is a tuple such that there is a set of \(k\) assertions whose appending to the ontology makes this tuple a certain answer while keeping the ontology consistent. The proposed computational method works in polynomial time in terms of data complexity for DL ontologies with first-order rewritable TBoxes.

Keywords

Conjunctive Queries (CQ) User Interaction Module Conjunctive Query Answering (CQA) Lehigh University Benchmark (LUBM) OBDA Systems 
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

Acknowledgments

This work is partly supported by the NSFC grants (61375056 and 61005043), the Guangdong Natural Science Foundation (S2013010012928), the Undergraduate Innovative Experiment Projects in Guangdong University of Foreign Studies (1184613038, 1184613026 and 201411846043), and the Business Intelligence Key Team of Guangdong University of Foreign Studies (TD1202).

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)Google Scholar
  2. 2.
    Borgida, A., Calvanese, D., Rodriguez-Muro, M.: Explanation in the DL – Lite family of description logics. In: Meersman, R., Tari, Z. (eds.) OTM 2008, Part II. LNCS, vol. 5332, pp. 1440–1457. Springer, Heidelberg (2008)Google Scholar
  3. 3.
    Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. J. Web Semant. 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)CrossRefzbMATHGoogle 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)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Du, J., Qi, G., Shen, Y.: Weight-based consistent query answering over inconsistent \({\cal SHIQ}\) knowledge bases. Knowl. Inf. Syst. 34(2), 335–371 (2013)CrossRefGoogle Scholar
  7. 7.
    Du, J., Wang, K., Shen, Y.: A tractable approach to ABox abduction over description logic ontologies. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI), pp. 1034–1040 (2014)Google Scholar
  8. 8.
    Du, J., Wang, S., Qi, G., Pan, J.Z., Hu, Y.: A new matchmaking approach based on abductive conjunctive query answering. In: Pan, J.Z., Chen, H., Kim, H.-G., Li, J., Wu, Z., Horrocks, I., Mizoguchi, R., Wu, Z. (eds.) JIST 2011. LNCS, vol. 7185, pp. 144–159. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  9. 9.
    Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for OWL knowledge base systems. J. Web Semant. 3(2–3), 158–182 (2005)CrossRefGoogle Scholar
  10. 10.
    Pérez-Urbina, H., Motik, B., Horrocks, I.: Tractable query answering and rewriting under description logic constraints. J. Appl. Logic 8(2), 186–209 (2010)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Jianfeng Du
    • 1
    Email author
  • Deqian Liu
    • 1
  • Can Lin
    • 1
  • Xuzhi Zhou
    • 1
  • Jiaqi Liang
    • 1
  1. 1.Guangdong University of Foreign StudiesGuangzhouChina

Personalised recommendations