The Event Calculus as a Linear Logic Program

• Author(s) / Creator(s)

  • Alexiev, Vladimir

• Technical report TR95-24. The traditional presentation of Kowalski's Event Calculus as a logic program uses Negation- as-Failure (NAF) in an essential way to support persistence of fluents. In this paper we present an implementation of Event Calculus as a purely logical (without NAF) Linear Logic (LL) program. This work demonstrates some of the internal non-monotonic features of LL and its suitability for knowledge update (as opposed to knowledge revision). Although NAF is an ontologically sufficient solution to the frame problem, the LL solution is implementationally superior. Handling of incomplete temporal descriptions and support for ramifications (derived fluents) are also considered. | TRID-ID TR95-24

• Date created

  1995

• Subjects / Keywords

  • Negation as failure
  • Linear logic
  • Event calculus
  • Knowledge update

• Type of Item

  Report

• DOI

  https://doi.org/10.7939/R3RN30899

• License

  Attribution 3.0 International