M. Tismenetsky
International Journal of Computer Mathematics
Paper
On datalog vs polynomial time
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. © 1995 by Academic Press, Inc.
Related
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences