Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
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
D.S. Turaga, K. Ratakonda, et al.
SCC 2006
Simeon Furrer, Dirk Dahlhaus
ISIT 2005
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008