Time and incompleteness in a deductive database
Much attention has been given to the problem of time and how it can be handled within a logic based system. Another problem which has attracted considerable attention is that of incompleteness — a concept which is particularly relevant in the temporal domain. This paper considers how these two ideas may be brought together to produce a powerful system for dealing with data with a significant temporal variation.
KeywordsDeductive database incomplete information temporal database
Unable to display preview. Download preview PDF.
- 2.Burgess J.P. (1979), “Logic and Time,” Journal of Symbolic Logic, Vol. 44, (4), pp. 566–581, (December 1979).Google Scholar
- 3.Chang C.L. and Lee R.C.T. (1973), Symbolic logic and mechanical theorem proving, Academic Press, New York, N.Y., (1973).Google Scholar
- 6.Kowalski R.A. (1986), “Database updates in the event calculus,” Imperial College, pp. 1–29, (1986).Google Scholar
- 7.Kowalski R.A. and Sergot M. (1986), “A logic-based calculus of events,” New Generation Computing, Vol. 4, (1), pp. 67–95, OHMSHA, LTD. and Springer-Verlag, (1986).Google Scholar
- 8.McCarthy J. and Hayes P.J. (1969), “Some philosophical problems from the standpoint of artificial intelligence,” in Machine Intelligence, ed. B. Meltzer and D. Michie, Edinburgh University Press, Edinburgh, (1969).Google Scholar
- 13.Williams M.H., Kong Q., and Chen G. (1988), “Handling incomplete information in a logic database,” in UK IT 88 Conference Publication, pp. 224–227, (1988).Google Scholar