Termination Analysis for Tabled Logic Programming

Decorte, S; Schreye, D; Leuschel, M; Martens, B; Sagonas, K

dc.contributor.author	Decorte, S	en
dc.contributor.author	Schreye, D	en
dc.contributor.author	Leuschel, M	en
dc.contributor.author	Martens, B	en
dc.contributor.author	Sagonas, K	en
dc.date.accessioned	2014-03-01T02:48:29Z
dc.date.available	2014-03-01T02:48:29Z
dc.date.issued	1997	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33851
dc.subject	Automatic Verification	en
dc.subject	Left To Right	en
dc.subject	Logic Programs	en
dc.subject	Termination Analysis	en
dc.title	Termination Analysis for Tabled Logic Programming	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-49674-2_6	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-49674-2_6	en
heal.publicationDate	1997	en
heal.abstract	For the query p(X), the program finitely fails in SLG since its left-to-right evaluation encounters (a variant of) an existing call for which no answers can be produced. By performing one unfolding step with respect to the atom Y = f(X), giving rise to the clause p(X) p(f(X)), the same query p(X) will now result in an infinite computation under	en
heal.journalName	Logic Program Synthesis and Transformation	en
dc.identifier.doi	10.1007/3-540-49674-2_6	en