Tabled Logic Programs: Principles, Practice and Applications

Ramakrishnan, C; Ramakrishnan, I; Sagonas, K; Swift, T; Warren, D

dc.contributor.author	Ramakrishnan, C	en
dc.contributor.author	Ramakrishnan, I	en
dc.contributor.author	Sagonas, K	en
dc.contributor.author	Swift, T	en
dc.contributor.author	Warren, D	en
dc.date.accessioned	2014-03-01T01:44:34Z
dc.date.available	2014-03-01T01:44:34Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24411
dc.subject	Logic Programs	en
dc.subject	Program Evaluation	en
dc.title	Tabled Logic Programs: Principles, Practice and Applications	en
heal.type	journalArticle	en
heal.publicationDate	1996	en
heal.abstract	Compilation (e.g.,see [35, 53])-- From a given source (concrete) program, obtain an abstract program.-- Concrete semantics of abstract programjabstract semantics of concrete program.-- Evaluate abstract program using some complete evaluationstrategy.34Applications: Program AnalysisExample: Groundness Analysis (from [25])append([],Ys,Ys).append([X---Xs],Ys,[X---Zs]) :- append(Xs,Ys,Zs).+gappend(g,Y,Y).gappend(X1,Ys,Z1) :- iff(X1,X,Xs), iff(Z1,X,Zs),...	en