Temporal indeterminacy in deductive databases: An approach based on event calculus

7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we deal with the notion of temporal indeterminacy in temporal deductive databases. We adopt Kowalski and Sergot's Event Calculus (1986, 1992) as our data model. To the best of our knowledge, no previous research efforts have been devoted to introduce indeterminacy in the Event Calculus (EC). We first motivate the need for indeterminacy in real world applications. Then, after briefly presenting EC, we illustrate in detail our proposal (TIC, Temporal Indeterminacy event Calculus). From a description of events whose precise temporal occurrence is unknown, and a description of the properties initiated or terminated by those events, TIC derives intervals over which properties are necessarily valid, and intervals of indeterminacy for the initiating and terminating instants of the properties. Although we adopt EC as our ontology, the proposed ideas can be reformulated for adoption in other approaches. TIC is presented both informally and formally, and illustrated with several examples. Finally, we discuss completeness and complexity issues of TIC.

Cite

CITATION STYLE

APA

Chittaro, L., & Combi, C. (1998). Temporal indeterminacy in deductive databases: An approach based on event calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1553, pp. 212–227). Springer Verlag. https://doi.org/10.1007/3-540-49151-1_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free