• Sign In / Register
  • Help
  • Basket0
Logics for Databases and Information Systems - The Springer International Series in Engineering and Computer Science 436 (Paperback)
  • Logics for Databases and Information Systems - The Springer International Series in Engineering and Computer Science 436 (Paperback)
zoom

Logics for Databases and Information Systems - The Springer International Series in Engineering and Computer Science 436 (Paperback)

(editor), (editor)
£215.50
Paperback 430 Pages / Published: 21/10/2012
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: Springer-Verlag New York Inc.
ISBN: 9781461375821
Number of pages: 430
Weight: 682 g
Dimensions: 235 x 155 x 23 mm
Edition: Softcover reprint of the original 1st ed. 199

You may also be interested in...

Deep Learning
Added to basket
£39.99
Paperback
Artificial Intelligence: The Basics
Added to basket
Dark Pools
Added to basket
£9.99
Paperback
The Quest for Artificial Intelligence
Added to basket
The Singularity is Near
Added to basket
Machine Learning
Added to basket
£39.99
Paperback
Thoughtful Machine Learning
Added to basket
Introducing Artificial Intelligence
Added to basket
Understanding Beliefs
Added to basket
Reinforcement Learning
Added to basket
Probabilistic Graphical Models
Added to basket
Probabilistic Robotics
Added to basket
Darwin Among the Machines
Added to basket
Machine Learning
Added to basket
Bayesian Reasoning and Machine Learning
Added to basket
Emotion: A Very Short Introduction
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.