On Datalog vs. LFP

We show that the homomorphism preservation theorem fails for LFP, both in general and in restriction to finite structures. That is, there is a formula of LFP that is preserved under homomorphisms (in the finite) but is not equivalent (in the finite) to a Datalog program. This resolves a question pos...

Full description

Bibliographic Details
Main Authors: Dawar, A, Kreutzer, S
Format: Conference item
Published: 2008