Logic Programming 06-25433 Autumn 2012

Lecture 20: Beyond Prolog: Concurrent Logic Programming 2 This lecture introduces programming in a concurrent logic language, FCP(|). It looks at the use of guards before introducing communcation and synchronization using the logic variable.

How to prepare   Consider the problem of merging two lists: [a,b,c] and [1,2,3]. In how many orders can these lists be merged?

Video   No video (technical problems with recorder)

Slides   If you really want the slides from the lecture ... 1 slide per page 6 slides per page but don't forget printing the slides is not the same as understanding them.

Summary   Summary and programs with commentary from the lecture

Programs from the lecture   Example 1 - unordered merge Example 2 - hamming numbers

Individual study suggestions and further reading   Constraint Logic Programming is introduced in: Buhr, P.A. & Harji, A.S. Concurrent urban legends. Concurrency and Computation: Practice & Experience 17(9), 2005, pp.1133 - 1172. Note: Downloadable from the University network (2012-11-24). Gregory, S. Parallel logic programming in PARLOG : the language and its implementation. Addison-Wesley, 1987. Shapiro, E. The family of concurrent logic programming languages. ACM Computing Surveys 21(3), 1989, pp. 413-510. Note: Downloadable from the University network (2012-11-24).

Assessed work associated with this lecture   Tutorial sheet 6