Time and incompleteness in a deductive database

  • M. H. Williams
  • Q. Kong
8. Uncertainty In Intelligent Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 521)


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.


Deductive database incomplete information temporal database 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Allen J.F. (1983), “Maintaining knowledge about temporal intervals,” Communications of the ACM, Vol. 26, (11), pp. 832–843, (1983).CrossRefGoogle Scholar
  2. 2.
    Burgess J.P. (1979), “Logic and Time,” Journal of Symbolic Logic, Vol. 44, (4), pp. 566–581, (December 1979).Google Scholar
  3. 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
  4. 4.
    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).CrossRefGoogle Scholar
  5. 5.
    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).CrossRefGoogle Scholar
  6. 6.
    Kowalski R.A. (1986), “Database updates in the event calculus,” Imperial College, pp. 1–29, (1986).Google Scholar
  7. 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. 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
  9. 9.
    Robinson J.A. (1965), “A machine-oriented logic based on the resolution principle,” Journal of ACM, Vol. 12, (1), pp. 23–41, (1965).CrossRefGoogle Scholar
  10. 10.
    Sernadas A. (1980), “Temporal aspects of logical procedure definition,” Information Systems, Vol. 5, pp. 167–187, (1980).CrossRefGoogle Scholar
  11. 11.
    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).CrossRefMathSciNetGoogle Scholar
  12. 12.
    Williams M.H. and Kong Q. (1988), “Incomplete information in a deductive database,” Data and Knowledge Engineering, Vol. 3, pp. 197–220, (1988).CrossRefGoogle Scholar
  13. 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
  14. 14.
    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).CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • M. H. Williams
    • 1
  • Q. Kong
    • 2
  1. 1.Department of Computer ScienceHeriot-Watt UniversityEdinburgh
  2. 2.CITR, Ritchie Research LaboratoriesUniversity of QueenslandAustralia

Personalised recommendations