论文信息 - Datalog vs First-Order Logic

Datalog vs First-Order Logic

The relation between the expressive power of datalog and that of first-order languages, is clarified. It is then proved that every first-order expressible datalog query is bounded. A form of compactness theorem for finite structure implied by this result is examined, and counterexamples to natural generalizations of the above result are given. >

Yuri Gurevich | Miklós Ajtai

[1] Michael M. Richter,et al. Computation and Proof Theory , 1984 .

[2] Paul D. Seymour,et al. Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[3] H. Gaifman. On Local and Non-Local Properties , 1982 .

[4] Ronald Fagin,et al. Monadic generalized spectra , 1975, Math. Log. Q..

[5] Yuri Gurevich,et al. Toward logic tailored for computational complexity , 1984 .

[6] Stavros S. Cosmadakis. On the first-order expressibility of recursive queries , 1989, PODS '89.