Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
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
Neave effect also occurs with Tausworthe sequences
Shu Tezuka
WSC 1991
Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering