Title :
Event Calculus with explicit quantifiers
Author :
Cervesato, Iliano ; Franceschet, Massimo ; Montanari, Angelo
Author_Institution :
Dept. of Comput. Sci., Stanford Univ., CA, USA
Abstract :
Kowalski and Sergot´s (1986) Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which properties initiated or terminated by these events hold. We extend this calculus to give a semantic foundation to our Quantifiers and Connectives Event Calculus (QCEC). In particular, we extend the range of queries accepted by EC, which has so far been limited to Boolean combinations of MVI verification or computation requests, to admit arbitrary quantification over events and properties. We demonstrate the added expressive power by encoding a medical diagnosis problem as a case study. Moreover, we give a λProlog implementation of this formalism and analyze the computational complexity of the extended calculus
Keywords :
PROLOG listings; calculus; computational complexity; medical diagnostic computing; patient diagnosis; process algebra; temporal logic; λProlog implementation; Boolean combinations; Event Calculus; QCEC; arbitrary quantification; case study; computation requests; computational complexity; connectives; event occurrences; explicit quantifiers; expressive power; extended calculus; interval verification; maximal validity intervals; medical diagnosis problem encoding; property initiation; property termination; query range; semantics; temporal formalism; Boolean functions; Calculus; Casting; Computational complexity; Computer science; Encoding; Logic programming; Medical diagnosis; Polynomials; Research initiatives;
Conference_Titel :
Temporal Representation and Reasoning, 1998. Proceedings. Fifth International Workshop on
Conference_Location :
Sanibel Island, FL
Print_ISBN :
0-8186-8473-9
DOI :
10.1109/TIME.1998.674136