Efficient Tabling Mechanisms for Logic Programs

Ramakrishnan, I; Rao, P; Sagonas, K; Swift, T; Warren, D

dc.contributor.author	Ramakrishnan, I	en
dc.contributor.author	Rao, P	en
dc.contributor.author	Sagonas, K	en
dc.contributor.author	Swift, T	en
dc.contributor.author	Warren, D	en
dc.date.accessioned	2014-03-01T02:48:18Z
dc.date.available	2014-03-01T02:48:18Z
dc.date.issued	1995	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33713
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/conf/iclp/iclp95.html#RamakrishnanRSSW95	en
dc.subject	Experimental Evaluation	en
dc.subject	High Performance	en
dc.subject	Logic Programs	en
dc.subject	Bottom Up	en
dc.subject	Top Down	en
dc.title	Efficient Tabling Mechanisms for Logic Programs	en
heal.type	conferenceItem	en
heal.publicationDate	1995	en
heal.abstract	The use of tabling in logic programming allows bottom-up evaluation to be incorporatedin a top-down framework, combining advantages of both. At the engine level,tabling also introduces complications not present in pure top-down evaluation, dueto the need to access subgoals and answers during clause resolution. This paper describesthe design, implementation, and experimental evaluation of data structuresand algorithms for high-performance table access.Our	en
heal.journalName	International Conference on Logic Programming/Joint International Conference and Symposium on Logic Programming	en