Memory Management for Prolog with Tabling

Memory Management for Prolog with Tabling (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Bart Demoen , Konstantinos Sagonas

Venue:	In Proceedings of ISMM'98: ACM SIGPLAN International Symposium on Memory Management
Citations:	9 - 8 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Memory Management for Prolog with Tabling	SVM HeaderParse 0.1
AUTHOR NAME	Bart Demoen	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science	SVM HeaderParse 0.2
AUTHOR NAME	Konstantinos Sagonas	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science	SVM HeaderParse 0.2
ABSTRACT	Tabling can be implemented in a (WAM-based) Prolog system by means of SLG-WAM: consumers suspend and their state is preserved by freezing the execution stacks. XSB is a system that currently implements tabling based on the SLG-WAM. The memory model is quite complex and attempts to understand the notion of usefulness of data in XSB well enough to build a precise garbage collector have failed in the past. CAT is a recent alternative to SLG-WAM: it suspends consumers by copying parts of the execution stacks. The memory model is simpler and the design of a more precise garbage collector became feasible. CAT also provided the necessary insights in the usefulness of data in the context of the SLG-WAM. This paper describes the memory management of tabled logic programming systems, whether based on the SLG-WAM or on CAT. Since CAT can perform arbitrarily worse than SLG-WAM space-wise, also a minor garbage collection on creation of the CAT areas is described and its effectiveness is discussed.	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE	In Proceedings of ISMM'98: ACM SIGPLAN International Symposium on Memory Management	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	97--106	INFERENCE
TECH	Technical Report CW 261	INFERENCE
CITATIONS	14 found	ParsCit 1.0