Reasoning about knowledge and time in asynchronous systems
Joseph Y. Halpern, Moshe Y. Vardi
STOC 1988
We propose here a data model that generalizes the relational, hierarchical, and network models. A database scheme in this model is a directed graph, where leaves represent data and internal nodes represent connections between the data. Instances are constructed from r-values, which constitute the data space, and l-values, which constitue the address space. We define a logic for the model, and describe a non-procedural quary language that is based on the logic. Finally, we describe an algebraic query language and show that it is equivalent to the logical language.
Joseph Y. Halpern, Moshe Y. Vardi
STOC 1988
Moshe Y. Vardi
Information Processing Letters
Joseph Y. Halpern, Moshe Y. Vardi
Journal of Computer and System Sciences
Georg Lausen, Eljas Soisalon-Soininen, et al.
SIGMOD/PODS 1984