Temporal Deductive Databases and Infinite Objects

Jan Chomicki; Tomasz Imieliński

doi:10.1145/308386.308416

Temporal Deductive Databases and Infinite Objects

Jan Chomicki
, Tomasz Imieliński

Department of Computer Science and Engineering

Rutgers - The State University of New Jersey, New Brunswick

Research output: Contribution to conference › Paper › peer-review

81 Scopus citations

Abstract

We discuss deductive databases with one fixed occurrence of a monadic function symbol (successor) per predicate Databases of this kind can be used in a natural way to model simple patterns of events repeated in time, and this is why we term them temporal.

Original language	English
Pages	61-73
Number of pages	13
DOIs	https://doi.org/10.1145/308386.308416
State	Published - 1988
Event	Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - Austin, TX, USA Duration: Mar 21 1988 → Mar 23 1988

Conference

Conference	Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
City	Austin, TX, USA
Period	03/21/88 → 03/23/88

Access to Document

10.1145/308386.308416

Cite this

@conference{a263a116133c455db239d18e22e3388d,

title = "Temporal Deductive Databases and Infinite Objects",

abstract = "We discuss deductive databases with one fixed occurrence of a monadic function symbol (successor) per predicate Databases of this kind can be used in a natural way to model simple patterns of events repeated in time, and this is why we term them temporal.",

author = "Jan Chomicki and Tomasz Imieli{\'n}ski",

note = "Publisher Copyright: {\textcopyright} 1988 ACM.; Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems ; Conference date: 21-03-1988 Through 23-03-1988",

year = "1988",

doi = "10.1145/308386.308416",

language = "English",

pages = "61--73",

}

TY - CONF

T1 - Temporal Deductive Databases and Infinite Objects

AU - Chomicki, Jan

AU - Imieliński, Tomasz

PY - 1988

Y1 - 1988

N2 - We discuss deductive databases with one fixed occurrence of a monadic function symbol (successor) per predicate Databases of this kind can be used in a natural way to model simple patterns of events repeated in time, and this is why we term them temporal.

AB - We discuss deductive databases with one fixed occurrence of a monadic function symbol (successor) per predicate Databases of this kind can be used in a natural way to model simple patterns of events repeated in time, and this is why we term them temporal.

UR - https://www.scopus.com/pages/publications/85139764950

U2 - 10.1145/308386.308416

DO - 10.1145/308386.308416

M3 - Paper

AN - SCOPUS:85139764950

SP - 61

EP - 73

T2 - Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Y2 - 21 March 1988 through 23 March 1988

ER -

Temporal Deductive Databases and Infinite Objects

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this