Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
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
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics