Skip to main content

Part of the book series: Topics in Information Systems ((TINF))

Abstract

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.

First published in New Generation Computing, Vol. 4, No. 1, 1986, pp. 67–95

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Allen, J.F., “Maintaining Knowledge About Temporal Intervals”, TR-86, Computer Science Dept., Univ. Rochester, January 1981, also in Communications of the ACM, Vol. 26, 1983, pp. 832-843.

    Google Scholar 

  2. Allen, J.F., “Towards a General Theory of Action and Time”, Artificial Intelligence, Vol. 23, 1984, pp. 123–154.

    Article  MATH  Google Scholar 

  3. Bolour, A., T.L. Anderson, L.J. Dekeyser, and H.K.T. Wong, “The Role of Time in Information Processing: A Survey”, ACM SIGMOD Review, Vol. 12, No. 3, April 1982.

    Google Scholar 

  4. Kowalski, R.A., Logic for Problem Solving, North-Holland, New York, 1979.

    MATH  Google Scholar 

  5. Lee, R.M., H. Coelho, and J.C. Cotta, “Temporal Inferencing on Administrative Databases”, Information Systems, Vol. 10, No. 2, 1985, pp. 197–206.

    Article  Google Scholar 

  6. McCarthy, J., and P.J. Hayes, “Some Philosophical Problems from the Standpoint of Artificial Intelligence”, in B. Meltzer and D. Michie (eds.), Machine Intelligence 4, Edinburgh Univ. Press, Edinburgh, 1969, pp. 463–502.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kowalski, R., Sergot, M. (1989). A Logic-Based Calculus of Events. In: Schmidt, J.W., Thanos, C. (eds) Foundations of Knowledge Base Management. Topics in Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83397-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83397-7_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-83399-1

  • Online ISBN: 978-3-642-83397-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics