株式会社極東書店トップ商品一覧Logics for Databases and Information Systems. Softcover reprint of the original 1st ed. 1998

商品詳細

Logics for Databases and Information Systems. Softcover reprint of the original 1st ed. 1998

Logics for Databases and Information Systems. Softcover reprint of the original 1st ed. 1998

・ISBN 978-1-4613-7582-1 paper EUR 199.99

¥53,456.- (税込) (※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。

お気に入り
著者・編者Chomicki, Jan / Saake, Gunter (eds.),
シリーズ (The Springer International Series in Engineering and Computer Science)
出版社 (Springer-Verlag New York Inc., US)
出版年月2012
ページ数430 pp.
言語ENG
ニュース番号<A04-80632>

解説

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.