Just enough tabling

Sagonas, K; Stuckey, P

dc.contributor.author	Sagonas, K	en
dc.contributor.author	Stuckey, P	en
dc.date.accessioned	2014-03-01T02:49:39Z
dc.date.available	2014-03-01T02:49:39Z
dc.date.issued	2004	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34669
dc.subject	Abstract Machine	en
dc.subject	Logic Programs	en
dc.title	Just enough tabling	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1013963.1013975	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1013963.1013975	en
heal.publicationDate	2004	en
heal.abstract	We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled logic programs to be performed without resorting to any recomputation. We discuss issues that are involved in supporting pruning in tabled resolution, how re-execution of tabled computations which were previously pruned	en
heal.journalName	Principles and Practice of Declarative Programming	en
dc.identifier.doi	10.1145/1013963.1013975	en