A logic-based calculus of events
- 107 Downloads
We outline an approach for reasoning about events and time within a logic programming framework. The notion of event is taken to be more primitive than that of time and both are represented explicitly by means of Horn clauses augmented with negation by failure.
The main intended applications are the updating of databases and narrative understanding. In contrast with conventional databases which assume that updates are made in the same order as the corresponding events occur in the real world, the explicit treatment of events allows us to deal with updates which provide new information about the past.
Default reasoning on the basis of incomplete information is obtained as a consequence of using negation by failure. Default conclusions are automatically withdrawn if the addition of new information renders them inconsistent.
Because events are differentiated from times, we can represent events with unknown times, as well as events which are partially ordered and concurrent.
KeywordsEvent Calculus Logic Programming PROLOG Temporal Logic Database Updates Default Reasoning
Unable to display preview. Download preview PDF.
- 1).Allen, J. F., “Maintaining knowledge about temporal intervals,”TR-86, Computer Science Dept., Univ. of Rochester, January, 1981; also inCommun. ACM, 26 pp. 832–843, 1983.Google Scholar
- 3).Bolour, A., Anderson, T. L., Dekeyser, L. J., and Wong, H. K. T., “The role of time in information processing: a survey,”ACM SIGMOD Review,Vol. 12,No. 3, April, 1982.Google Scholar
- 5).McCarthy, J. and Hayes, P. J., “Some philosophical problems from the standpoint of artificial intelligence,” inMachine Intelligence, 4 (B. Meltzer and D. Michie, eds.), Edinburgh University Press, Edinburgh, 1969.Google Scholar