Vienna Parallel logic ((V)P(L)) is a persistent language and programming system that supports the concurrent execution of communicating processes and the computation of several alternative solutions by means of progra...
详细信息
Vienna Parallel logic ((V)P(L)) is a persistent language and programming system that supports the concurrent execution of communicating processes and the computation of several alternative solutions by means of programmed backtracking. It unifies the worlds of sequential logic programming languages (Prolog) and concurrentlogic programming languages (i.e. Parlog). Aspects of both language classes can be combined to any desired degree within one computation. Such a language is well suited for multidatabase applications. Further characteristics include an advanced transaction model, the support of an architecture-neutral programming style, and the treatment of failing processes. We describe the language and briefly outline implementation issues of our prototype system.
This paper describes a new external reference management scheme for KL1, a committed choice logic programming language based on GHC. The significance of the new scheme is that it realizes incremental inter-processor g...
详细信息
This paper describes a new external reference management scheme for KL1, a committed choice logic programming language based on GHC. The significance of the new scheme is that it realizes incremental inter-processor garbage collection. Previous distributed implementations of committed choice languages had not seriously addressed inter-processor garbage collection.
Incremental inter-precessor garbage collection is realized by the Weighted Export Counting (WEC). It is a first attempt to use the weighted reference counting technique in logic programming language implementation, and is also new in that it has introduced export and import tables for making independent local garbage collection possible and reducing the number of inter-processor read requests.
The problems with exhaustion of reference counts and indirect exportation are discussed. Since the binding order rule adopted in our previous implementation for avoiding creation of reference loops is insufficient in the presence of indirect exportation, a new binding order rule is introduced. We prove that avoidance of reference loops is guaranteed and also prove that the unification procedure always terminates for non-circular structures.
暂无评论