Visit our Christmas Gift Finder
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 dispatched 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...

Reinforcement Learning
Added to basket
Artificial Intelligence: The Basics
Added to basket
Programming Game AI By Example
Added to basket
The Singularity Is Near
Added to basket
Superintelligence
Added to basket
£18.99
Hardback
Introduction to Machine Learning
Added to basket
Introducing Artificial Intelligence
Added to basket
Artificial Intelligence
Added to basket
Essentials of Game Theory
Added to basket
Bayesian Reasoning and Machine Learning
Added to basket
The Sciences of the Artificial
Added to basket
Machine Learning
Added to basket
£37.99
Paperback
Algorithms for Reinforcement Learning
Added to basket
Emotion: A Very Short Introduction
Added to basket
Machine Learning
Added to basket
£52.99
Mixed media product

Please sign in to write a review

Your review has been submitted successfully.