Datalog vs first-order logic
Ajtai, Miklos; Gurevich, Yuri
1994-12
Citation: Ajtai, Miklos, Gurevich, Yuri (1994/12)."Datalog vs first-order logic." Journal of Computer and System Sciences 49(3): 562-588. <http://hdl.handle.net/2027.42/31164>
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.
DOIs: http://dx.doi.org/10.1016/S0022-0000(05)80071-6
URI: http://www.sciencedirect.com/science/article/B6WJ0-4GX77T3-6/2/80470b72eba573e14bdb3f9c4abe265f
Handle: http://hdl.handle.net/2027.42/31164
Show full item record

PDF file
Download
Name: 0000063.pdf
Size: 1.4MB
Format: PDF

This item appears in the following Collection(s)


Search Deep Blue

Advanced Search

Browse by

My Account

Information


MLibrary logo