Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
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
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
George Markowsky
J. Math. Anal. Appl.
Leo Liberti, James Ostrowski
Journal of Global Optimization