Datalog vs first-order logic

https://doi.org/10.1016/S0022-0000(05)80071-6Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)

*

Supported by NSF grants CCR 89-04728, CCR 92-04742 and by ONR Grant N00014-91-J-11861. The main part of this work was done during 1988–89 academic year when this author was with Stanford University and IBM Almaden Research Center (on a sabbatical leave from the University of Michigan).