Logics for Databases and Information Systems

  • Jan Chomicki
  • Gunter Saake

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Stefan Conrad
    Pages 5-30
  3. Jan Chomicki, David Toman
    Pages 31-70
  4. J.-J. Ch. Meyer, R. J. Wieringa, F. P. M. Dignum
    Pages 71-115
  5. Anthony J. Bonner, Michael Kifer
    Pages 117-166
  6. Hans-Dieter Ehrich, Carlos Caleiro, Amilcar Sernadas, Grit Denker
    Pages 167-198
  7. Stefan Conrad, Jaime Ramos, Gunter Saake, Cristina Sernadas
    Pages 199-228
  8. Diego Calvanese, Maurizio Lenzerini, Daniele Nardi
    Pages 229-263
  9. Parke Godfrey, John Grant, Jarek Gryz, Jack Minker
    Pages 265-306
  10. Laks V.S. Lakshmanan, Krishnaprasad Thirunarayan
    Pages 357-388
  11. Georg Lausen, Bertram Ludäscher, Wolfgang May
    Pages 389-422
  12. Back Matter
    Pages 423-430

About this book


Time is ubiquitous in information systems. Almost every enterprise faces the problem of its data becoming out of date. However, such data is often valu­ able, so it should be archived and some means to access it should be provided. Also, some data may be inherently historical, e.g., medical, cadastral, or ju­ dicial records. Temporal databases provide a uniform and systematic way of dealing with historical data. Many languages have been proposed for tem­ poral databases, among others temporal logic. Temporal logic combines ab­ stract, formal semantics with the amenability to efficient implementation. This chapter shows how temporal logic can be used in temporal database applica­ tions. Rather than presenting new results, we report on recent developments and survey the field in a systematic way using a unified formal framework [GHR94; Ch094]. The handbook [GHR94] is a comprehensive reference on mathematical foundations of temporal logic. In this chapter we study how temporal logic is used as a query and integrity constraint language. Consequently, model-theoretic notions, particularly for­ mula satisfaction, are of primary interest. Axiomatic systems and proof meth­ ods for temporal logic [GHR94] have found so far relatively few applications in the context of information systems. Moreover, one needs to bear in mind that for the standard linearly-ordered time domains temporal logic is not re­ cursively axiomatizable [GHR94]' so recursive axiomatizations are by necessity incomplete.


concurrency database description logics information information system programming semantics

Editors and affiliations

  • Jan Chomicki
    • 1
  • Gunter Saake
    • 2
  1. 1.Monmouth UniversityUSA
  2. 2.University of MagdeburgGermany

Bibliographic information

  • DOI
  • Copyright Information Kluwer Academic Publishers 1998
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-7582-1
  • Online ISBN 978-1-4615-5643-5
  • Series Print ISSN 0893-3405
  • Buy this book on publisher's site