On Transformations into Linear Database Logic Programs

Afrati, F; Gergatsoulis, M; Katzouraki, M

dc.contributor.author	Afrati, F	en
dc.contributor.author	Gergatsoulis, M	en
dc.contributor.author	Katzouraki, M	en
dc.date.accessioned	2014-03-01T02:48:22Z
dc.date.available	2014-03-01T02:48:22Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33773
dc.subject	Deductive Databases	en
dc.subject	Logic Programs	en
dc.subject	Program Transformation	en
dc.subject	Linear Logic	en
dc.title	On Transformations into Linear Database Logic Programs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-62064-8_36	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-62064-8_36	en
heal.publicationDate	1996	en
heal.abstract	. We consider the problem of transformations of logic programswithout function symbols (database logic programs) into a specialsubclass, namely linear logic programs. Linear logic programs are definedto be the programs whose rules have at most one intentional atomin their bodies. a) We investigate linearizability of several syntacticallydefined subclasses of programs and present both positive and negativeresults (i.e. demonstrate programs that	en
heal.journalName	Ershov Memorial Conference	en
dc.identifier.doi	10.1007/3-540-62064-8_36	en