Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
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
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering