Datalog vs first-order logic
作者：
Highlights：
•
摘要
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.
论文关键词：
论文评审过程：Received 30 November 1989, Revised 28 February 1993, Available online 19 August 2005.
论文官网地址：https://doi.org/10.1016/S0022-0000(05)80071-6
