David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Paper
Datalog vs first-order logic
Abstract
Our main result is that every datalog query expressible in first-order logic is bounded; in terms of classical model theory it is a kind of compactness theorem for finite structures. In addition, we give some counter-examples delimiting the main result. © 1994 by Academic Press, Inc.
Related
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences