Skip to main content

The Ramification Problem in Temporal Databases: A Solution Implemented in SQL

  • Conference paper
  • 1044 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4994))

Abstract

In this paper we elaborate on the handling of the ramification problem in the setting of temporal databases. Starting with the observation that solutions from the literature on reasoning about action are inadequate for addressing the ramification problem, in our prior work we have presented a solution based on an extension of the situation calculus and the work of McCain and Turner. In this paper, we present a tool that connects the theoretical results to practical considerations, by producing the appropriate SQL commands in order to address the ramification problem.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, J.F.: Maintaining Knowledge about Temporal Intervals. Communications of the ACM 26(11), 832–843 (1983)

    Article  MATH  Google Scholar 

  2. Denecker, M., Ternovska, E.: Inductive situation calculus. Artificial Intelligence archive 171(5-6), 332–360 (2007)

    Article  MathSciNet  Google Scholar 

  3. Drescher, C., Thielscher, M.: Integrating Action Calculi and Description Logics. In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 68–83. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Giordano, L., Martelli, A., Schwind, C.: Specialization of Interaction Protocols in a Temporal Action Logic. In: LCMAS 2005 pp. 3–22 (2005)

    Google Scholar 

  5. Fusaoka, A.: Situation Calculus on a Dense Flow of Time. In: AAAI 1996, pp. 633–638 (1996)

    Google Scholar 

  6. McCain, N., Turner, H.: A causal theory of ramifications and qualifications. In: Proceedings of IJCAI 1995, pp. 1978–1984 (1995)

    Google Scholar 

  7. McCarthy, J., Hayes, P.J.: Some philophical problem from the standpoint of artificial intelligence. Machine Intelligence 4, 463–502 (1969)

    Google Scholar 

  8. Miller, R., Shanahan, M.: The Event Calculus in Classical Logic - Alternative Axiomatisations. Link. Elect. Art. in Compt. and Inform. Sc. 4(16) (1999)

    Google Scholar 

  9. Papadakis, N., Plexousakis, D.: Action with Duration and Constraints: The Ramification problem in Temporal Databases. International Journal of Artificial Intelligent Tools (IJTAI) 12(3), 315–353 (2003)

    Article  Google Scholar 

  10. Reiter, R.: Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Aijun An Stan Matwin Zbigniew W. Raś Dominik Ślęzak

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papadakis, N., Plexousakis, D., Antoniou, G., Daskalakis, M., Christodoulou, Y. (2008). The Ramification Problem in Temporal Databases: A Solution Implemented in SQL. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds) Foundations of Intelligent Systems. ISMIS 2008. Lecture Notes in Computer Science(), vol 4994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68123-6_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68123-6_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68122-9

  • Online ISBN: 978-3-540-68123-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics