COLLIDING PUCKS SOLVED USING A TEMPORAL LOGIC

John G. Cleary · Libraries and Cultural Resources (University of Calgary) · 1989

A 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.

Read the paper · More papers on PaperTik