Journal of Computer and System SciencesVolume 51, Issue 2, October 1995, Pages 177-196Symposium ArticleOn Datalog vs Polynomial TimeAuthor links open overlay panelAfrati F., Cosmadakis S.S., Yannakakis M.Show moreShareCitehttps://doi.org/10.1006/jcss.1995.1060Get rights and contentUnder an Elsevier user licenseopen archiveAbstractWe 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.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1995 Academic Press. All rights reserved.
