On datalog vs polynomial time

Afrati, F; Cosmadakis, SS; Yannakakis, M

dc.contributor.author	Afrati, F	en
dc.contributor.author	Cosmadakis, SS	en
dc.contributor.author	Yannakakis, M	en
dc.date.accessioned	2014-03-01T01:11:18Z
dc.date.available	2014-03-01T01:11:18Z
dc.date.issued	1995	en
dc.identifier.issn	0022-0000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11597
dc.subject	Polynomial Time	en
dc.subject	Lower Bound	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Computational complexity	en
dc.subject.other	Constraint theory	en
dc.subject.other	Polynomials	en
dc.subject.other	Recursive functions	en
dc.subject.other	Theorem proving	en
dc.subject.other	Datalog	en
dc.subject.other	Monotonic polynomial time queries	en
dc.subject.other	Pumping lemma	en
dc.subject.other	Query languages	en
dc.title	On datalog vs polynomial time	en
heal.type	journalArticle	en
heal.identifier.primary	10.1006/jcss.1995.1060	en
heal.identifier.secondary	http://dx.doi.org/10.1006/jcss.1995.1060	en
heal.language	English	en
heal.publicationDate	1995	en
heal.abstract	We show that certain monotonic polynomial time queries are not expressible in variants of Datalog. The proof techniques include lower bounds for monotone circuit size and a ''Pumping Lemma'' for Datalog queries. (C) 1995 Academic Press, Inc.	en
heal.publisher	ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS	en
heal.journalName	Journal of Computer and System Sciences	en
dc.identifier.doi	10.1006/jcss.1995.1060	en
dc.identifier.isi	ISI:A1995RZ74200005	en
dc.identifier.volume	51	en
dc.identifier.issue	2	en
dc.identifier.spage	177	en
dc.identifier.epage	196	en