Modular Termination Proofs for Prolog with Tabling

Verbaeten, S; Sagonas, K; Schreye, D

dc.contributor.author	Verbaeten, S	en
dc.contributor.author	Sagonas, K	en
dc.contributor.author	Schreye, D	en
dc.date.accessioned	2014-03-01T02:48:43Z
dc.date.available	2014-03-01T02:48:43Z
dc.date.issued	1999	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34051
dc.subject	Logic Programs	en
dc.title	Modular Termination Proofs for Prolog with Tabling	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/10704567_21	en
heal.identifier.secondary	http://dx.doi.org/10.1007/10704567_21	en
heal.publicationDate	1999	en
heal.abstract	Tabled execution of logic programs avoids many of the shortcomings of SLD(NF) executionand provides a more flexible and efficient execution mechanism for logic programs. Inparticular, tabled execution of logic programs terminates more often than execution based onSLD-resolution. One of the few works studying termination under tabled execution mechanismis that of Decorte et al. They introduce and characterise two notions of	en
heal.journalName	Principles and Practice of Declarative Programming	en
dc.identifier.doi	10.1007/10704567_21	en