We show how to implement efficient copying garbage collection for Prolog. We measure the
efficiency of the collector compared to a standard mark-sweep algorithm on several …

We present a bottom-up copying garbage collector for WAM based Prolog. In contrast to the
top-down copying garbage collector of Bevemyr and Lindgren, it preserves the order of the …

Garbage collection by copying is becoming more and more popular for Prolog. Copying
requires a marking phase in order to be safe: safeness means that the to-space is …

We treat two important issues in heap garbage collection for WAM-based Prolog systems.
First we describe a new method for preserving the order of heap segments in a copying …

Starting from a theoretical understanding of the usefulness logic of a logic programming
system with built-in tabling, and from a collector that did not take the characteristics of a …

The paper presents the cache performance analysis of the Chronological Garbage
Collection algorithm used in the LVM system. The LVM is a new Logic Virtual Machine for …

The design and implementation of an incremental copying heap garbage collector for WAM-
based Prolog systems is presented. Its heap layout consists of a number of equal-sized …

We address memory management aspects of WAM-based logic programming systems that
support tabled evaluation through the use of a suspension/resumption mechanism. We …

Prolog is widely used in prototyping, especially in artificial intelligence, but it has yet to gain
widespread acceptance in application development. We think that the problems in this area …

We show how to combine a sequential copying garbage collector for Prolog with a scheme
for parallel shared memory copying collection, and how to extend these schemes for …