0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming

Buy Now

Logics for Databases and Information Systems (Hardcover, 1998 ed.) Loot Price: R5,430
Discovery Miles 54 300
Logics for Databases and Information Systems (Hardcover, 1998 ed.): Jan Chomicki, Gunter Saake

Logics for Databases and Information Systems (Hardcover, 1998 ed.)

Jan Chomicki, Gunter Saake

Series: The Springer International Series in Engineering and Computer Science, 436

 (sign in to rate)
Loot Price R5,430 Discovery Miles 54 300 | Repayment Terms: R509 pm x 12*

Bookmark and Share

Expected to ship within 18 - 22 working days

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.

General

Imprint: Springer
Country of origin: Netherlands
Series: The Springer International Series in Engineering and Computer Science, 436
Release date: 2001
First published: March 1998
Editors: Jan Chomicki • Gunter Saake
Dimensions: 235 x 155 x 25mm (L x W x T)
Format: Hardcover
Pages: 430
Edition: 1998 ed.
ISBN-13: 978-0-7923-8129-7
Categories: Books > Computing & IT > Computer programming > General
Books > Computing & IT > Applications of computing > Databases > General
Promotions
LSN: 0-7923-8129-7
Barcode: 9780792381297

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Problem Solving with C++ - Global…
Walter Savitch Paperback R2,584 Discovery Miles 25 840
Java Programming
Joyce Farrell Paperback R1,513 R1,434 Discovery Miles 14 340
Programming Logic & Design
Joyce Farrell Paperback R878 Discovery Miles 8 780
C++ Programming - Program Design…
D. Malik Paperback R1,929 R1,819 Discovery Miles 18 190
Program Construction - Calculating…
Roland Backhouse Paperback R1,481 Discovery Miles 14 810
Clean Architecture - A Craftsman's Guide…
Robert Martin Paperback  (1)
R681 Discovery Miles 6 810
Beginner's Step-by-Step Coding Course…
Dk Hardcover R601 Discovery Miles 6 010
Introducing Delphi Programming - Theory…
John Barrow, Linda Miller, … Paperback  (1)
R751 Discovery Miles 7 510
Programming Logic & Design…
Joyce Farrell Paperback R1,390 R1,315 Discovery Miles 13 150
Hardware Accelerator Systems for…
Shiho Kim, Ganesh Chandra Deka Hardcover R4,010 Discovery Miles 40 100
Dark Silicon and Future On-chip Systems…
Suyel Namasudra, Hamid Sarbazi-Azad Hardcover R4,000 Discovery Miles 40 000
Temporal Data Mining via Unsupervised…
Yun Yang Paperback R1,189 Discovery Miles 11 890

See more

Partners