An abstract machine for tabled execution of fixed-order stratified logic programs

Sagonas, K; Swift, T

dc.contributor.author	Sagonas, K	en
dc.contributor.author	Swift, T	en
dc.date.accessioned	2014-03-01T01:46:39Z
dc.date.available	2014-03-01T01:46:39Z
dc.date.issued	1998	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24975
dc.subject	Abstract Machine	en
dc.subject	Data Structure	en
dc.subject	Deductive Databases	en
dc.subject	Logic Programs	en
dc.subject	Performance Analysis	en
dc.subject	Stratification	en
dc.subject	Well Founded Semantics	en
dc.title	An abstract machine for tabled execution of fixed-order stratified logic programs	en
heal.type	journalArticle	en
heal.identifier.primary	10.1145/291889.291897	en
heal.identifier.secondary	http://dx.doi.org/10.1145/291889.291897	en
heal.publicationDate	1998	en
heal.abstract	SLG resolution uses tabling to evaluate nonfloundering normal logic pr ograms according to the well-founded semantics. The SLG-WAM, which forms the engine of the XSB system, can compute in-memory recursive queries an order of magnitute faster than current deductive databases. At the same time, the SLG-WAM tightly intergrates Prolog code with tabled SLG code, and executes Prolog code with minimal	en
heal.journalName	ACM Transactions on Programming Languages and Systems	en
dc.identifier.doi	10.1145/291889.291897	en