Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Allen J.F. (1983), “Maintaining knowledge about temporal intervals,” Communications of the ACM, Vol. 26, (11), pp. 832–843, (1983).
Burgess J.P. (1979), “Logic and Time,” Journal of Symbolic Logic, Vol. 44, (4), pp. 566–581, (December 1979).
Chang C.L. and Lee R.C.T. (1973), Symbolic logic and mechanical theorem proving, Academic Press, New York, N.Y., (1973).
Clifford J. and Warren D.S. (1983), “Formal semantics for time in databases,” ACM Transactions on Database Systems, Vol. 8, (2), pp. 214–254, (June 1983).
Fiadeiro J. and Sernadas A. (1986), “The infolog linear tense propositional logic of events and transactions,” Information Systems, Vol. 11, (1), pp. 61–85, (1986).
Kowalski R.A. (1986), “Database updates in the event calculus,” Imperial College, pp. 1–29, (1986).
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).
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).
Robinson J.A. (1965), “A machine-oriented logic based on the resolution principle,” Journal of ACM, Vol. 12, (1), pp. 23–41, (1965).
Sernadas A. (1980), “Temporal aspects of logical procedure definition,” Information Systems, Vol. 5, pp. 167–187, (1980).
Waugh K.G., Williams M.H., Kong Q., Salvini S., and Chen G. (1990), “Designing SQUIRREL: an extended SQL for a deductive database systems,” The Computer Journal, Vol. 33 (6), pp. 535–546, (1990).
Williams M.H. and Kong Q. (1988), “Incomplete information in a deductive database,” Data and Knowledge Engineering, Vol. 3, pp. 197–220, (1988).
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).
Williams M.H., Chen G., Ferbrache D., Massey P., Salvini S., Taylor H., and Wong K.F. (1988), “Prolog and deductive databases,” Knowledge-Based Systems, Vol. 1 (3), pp. 188–192, (1988).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Williams, M.H., Kong, Q. (1991). Time and incompleteness in a deductive database. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds) Uncertainty in Knowledge Bases. IPMU 1990. Lecture Notes in Computer Science, vol 521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028131
Download citation
DOI: https://doi.org/10.1007/BFb0028131
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54346-6
Online ISBN: 978-3-540-47580-4
eBook Packages: Springer Book Archive