M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
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.
M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence