Extending partial deduction to tabled execution: some results and open issues

Sagonas, K; Leuschel, M

dc.contributor.author	Sagonas, K	en
dc.contributor.author	Leuschel, M	en
dc.date.accessioned	2014-03-01T01:46:42Z
dc.date.available	2014-03-01T01:46:42Z
dc.date.issued	1998	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25011
dc.subject	Logic Programs	en
dc.subject	Partial Deduction	en
dc.title	Extending partial deduction to tabled execution: some results and open issues	en
heal.type	journalArticle	en
heal.identifier.primary	10.1145/289121.289137	en
heal.identifier.secondary	http://dx.doi.org/10.1145/289121.289137	en
heal.publicationDate	1998	en
heal.abstract	normally occur in PrologstyleSLD evaluation and avoids performing redundant subcomputations. As aresult, tabling significantly extends the range of applications of logic programming(LP). Moreover, because of the better termination and complexity properties oftabled execution, tabled-based systems such as XSB [Sagohas et al. 1994] make agood first step in fulfilling the promise of declarativeness: allow a programmer towrite problem specifications, and then	en
heal.journalName	ACM Computing Surveys	en
dc.identifier.doi	10.1145/289121.289137	en