ERA is in the process of being migrated to Scholaris, a Canadian shared institutional repository service (https://scholaris.ca). Deposits and changes to existing ERA items and collections are frozen until migration is complete. Please contact erahelp@ualberta.ca for further assistance
- 248 views
- 214 downloads
The Event Calculus as a Linear Logic Program
-
- Author(s) / Creator(s)
-
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
-
- Type of Item
- Report
-
- License
- Attribution 3.0 International