COLLIDING PUCKS SOLVED USING A TEMPORAL LOGIC

Simple item page
dc.contributor.authorCleary, John G.eng
dc.date.accessioned2008-05-26T20:42:10Z
dc.date.available2008-05-26T20:42:10Z
dc.date.computerscience1999-05-27eng
dc.date.issued1989-08-01eng
dc.description.abstractA Horn Clause logic programming language, called Starlog, which allows execution of programs involving time is described. A sound and complete bottom up execution procedure for the language is described. An extended example of Programming in Starlog is given in the form of a solution to the colliding pucks problem. A discussion of the features necessary for a distributed implementation of Starlog are given.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1989-358-20eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30534
dc.identifier.urihttp://hdl.handle.net/1880/46602
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleCOLLIDING PUCKS SOLVED USING A TEMPORAL LOGICeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1989-358-20.pdf
Size:
2.5 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications