Skip to main content

Prediction and Explanation over DL-Lite Data Streams

  • Conference paper
Book cover Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8312))

Abstract

Stream reasoning is an emerging research area focusing on the development of reasoning techniques applicable to streams of rapidly changing, semantically enhanced data. In this paper, we consider data represented in Description Logics from the popular DL-Lite family, and study the logic foundations of prediction and explanation over DL-Lite data streams, i.e., reasoning from finite segments of streaming data to conjectures about the content of the streams in the future or in the past. We propose a novel formalization of the problem based on temporal “past-future” rules, grounded in Temporal Query Language. Such rules can naturally accommodate complex data association patterns, which are typically discovered through data mining processes, with logical and temporal constraints of varying expressiveness. Further, we analyse the computational complexity of reasoning with rules expressed in different fragments of the temporal language. As a result, we draw precise demarcation lines between NP-, DP- and PSpace-complete variants of our setting and, consequently, suggest relevant restrictions rendering prediction and explanation more feasible in practice.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Valle, E.D., Ceri, S., van Harmelen, F., Fensel, D.: It’s a streaming world! reasoning upon rapidly changing information. IEEE Intelligent Systems 24(6) (2009)

    Google Scholar 

  2. Barbieri, D.F., Braga, D., Ceri, S., Valle, E.D., Huang, Y., Tresp, V., Rettinger, A., Wermser, H.: Deductive and inductive stream reasoning for semantic social media analytics. IEEE Intelligent Systems 25(6), 32–41 (2010)

    Article  Google Scholar 

  3. Lecue, F., Pan, J.Z.: Predicting Knowledge in An Ontology Stream. In: Proc. of the International Joint Conference on Artificial Intelligence, IJCAI 2013 (2013)

    Google Scholar 

  4. Shanahan, M.: Prediction is deduction but explanation is abduction. In: Proc. of the International Joint Conference on Artificial Intelligence, IJCAI 1989 (1989)

    Google Scholar 

  5. Thirunarayan, K., Henson, C.A., Sheth, A.P.: Situation awareness via abductive reasoning from semantic sensor data: A preliminary report. In: Proc. of the International Symposium on Collaborative Technologies and Systems, CTS 2009 (2009)

    Google Scholar 

  6. Akdere, M., Çetintemel, U., Upfal, E.: Database-support for continuous prediction queries over streaming data. In: Proc. of the International Conference on Very Large Data Bases, VLDB 2010 (2010)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Gutiérrez-Basulto, V., Klarman, S.: Towards a unifying approach to representing and querying temporal data in description logics. In: Krötzsch, M., Straccia, U. (eds.) RR 2012. LNCS, vol. 7497, pp. 90–105. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  9. Klarman, S., Meyer, T.: Prediction and explanation over DL-Lite data streams. Technical report, Centre for Artificial Intelligence Research, CSIR Meraka and University of KwaZulu-Natal (2013), http://klarman.synthasite.com/resources/KlaMeyLPAR13.pdf

  10. Baader, F., Calvanese, D., Mcguinness, D.L., Nardi, D., Patel-Schneider, P.F.: The description logic handbook: theory, implementation, and applications. Cambridge University Press (2003)

    Google Scholar 

  11. Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic EL using a relational database system. In: Proc. of the International Joint Conference on Artifical Intelligence, IJCAI 2009 (2009)

    Google Scholar 

  12. Ren, Y., Pan, J.Z.: Optimising ontology stream reasoning with truth maintenance system. In: Proc. of the ACM Conference on Information and Knowledge Management, CIKM 2011 (2011)

    Google Scholar 

  13. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. Journal of ACM 32(3), 733–749 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  14. Gabbay, D.: The declarative past and imperative future: Executable temporal logic for interactive systems. In: Proc. of the Conference on Temporal Logic in Specification, TLS 1987 (1987)

    Google Scholar 

  15. Guillame-Bert, M., Crowley, J.L.: Learning temporal association rules on symbolic time sequences. Journal of Machine Learning Research - Proceedings Track 25, 159–174 (2012)

    Google Scholar 

  16. Dhanya, C.T., Kumar, D.N.: Data mining for evolution of association rules for droughts and floods in India using climate inputs. Journal of Geophysical Research 114 (2009)

    Google Scholar 

  17. Elsenbroich, C., Kutz, O., Sattler, U.: A case for abductive reasoning over ontologies. In: Proc. of the International Workshop on OWL: Experiences and Directions, OWLED 2006 (2006)

    Google Scholar 

  18. Klarman, S., Endriss, U., Schlobach, S.: Abox abduction in the description logic \(\mathcal{ALC}\). Journal of Automated Reasoning 46, 43–80 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  19. Calvanese, D., Ortiz, M., Simkus, M., Stefanoni, G.: The complexity of explaining negative query answers in DL-Lite. In: Proc. of the International Conference on the Principles of Knowledge Representation and Reasoning, KR 2012 (2012)

    Google Scholar 

  20. Ribeiro, C., Porto, A.: Abduction in temporal reasoning. In: Gabbay, D.M., Ohlbach, H.J. (eds.) ICTL 1994. LNCS (LNAI), vol. 827, pp. 349–364. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  21. Kleinberg, S., Mishra, B.: The temporal logic of causal structures. In: Proc. of the Conference on Uncertainty in Artificial Intelligence, UAI 2009 (2009)

    Google Scholar 

  22. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6, 102–111 (1994)

    Article  Google Scholar 

  23. Governatori, G., Terenziani, P.: Temporal extensions to defeasible logic. In: Proc. of the Australian Conference on Advances in Artificial Intelligence (2007)

    Google Scholar 

  24. Kulkarni, K., Michels, J.E.: Temporal features in SQL: 2011. SIGMOD Rec. 41(3) (2012)

    Google Scholar 

  25. Barringer, H., Fisher, M., Gabbay, D., Gough, G., Owens, R.: MetateM: An introduction. Formal Aspects of Computing 7(5), 533–549 (1995)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klarman, S., Meyer, T. (2013). Prediction and Explanation over DL-Lite Data Streams. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2013. Lecture Notes in Computer Science, vol 8312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45221-5_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45221-5_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45220-8

  • Online ISBN: 978-3-642-45221-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics