Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
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
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering