Termination proofs for logic programs with tabling

Verbaeten, S; Schreye, D; Sagonas, K

dc.contributor.author	Verbaeten, S	en
dc.contributor.author	Schreye, D	en
dc.contributor.author	Sagonas, K	en
dc.date.accessioned	2014-03-01T01:50:59Z
dc.date.available	2014-03-01T01:50:59Z
dc.date.issued	2001	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/26196
dc.subject	Logic Programs	en
dc.title	Termination proofs for logic programs with tabling	en
heal.type	journalArticle	en
heal.identifier.primary	10.1145/371282.371357	en
heal.identifier.secondary	http://dx.doi.org/10.1145/371282.371357	en
heal.publicationDate	2001	en
heal.abstract	Tabled evaluation is receiving increasing attention in the logic programming community. It avoids many of the shortcomings of SLD execution and provides a more flexible and often considerably more efficient execution mechanism for logic programs. In particular, tabled execution terminates more often than execution based on SLD-resolution. In this article, we introduce two notions of universal termination of logic programming	en
heal.journalName	ACM Transactions on Computational Logic	en
dc.identifier.doi	10.1145/371282.371357	en