Article

On Datalog vs. LFP

Authors:

Stephan KreutzerAuthors Info & Claims

ICALP '08: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II

Pages 160 - 171

https://doi.org/10.1007/978-3-540-70583-3_14

Published: 07 July 2008 Publication History

Abstract

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 posed by Atserias. The results are established by two different methods: (1) a method of diagonalisation that works only in the presence of infinite structures, but establishes a stronger result showing a hierarchy of homomorphism-preserved problems in LFP; and (2) a method based on a pumping lemma for Datalog due to Afrati, Cosmadakis and Yannakakis which establishes the result in restriction to finite structures. We refine the pumping lemma of Afrati et al. and relate it to the power of Monadic Second-Order Logic on tree decompositions of structures.

References

[1]

Open Problems List for the MathsCSP Workshop, Oxford (2006), http://www.cs.rhul.ac.uk/home/green/mathscsp/

[2]

Afrati, F., Cosmadakis, S., Yannakakis, M.: On Datalog vs. Polynomial Time. Journal of Computer and System Sciences 51, 177-196 (1995)

Digital Library

[3]

Atserias, A.: The homomorphism preservation property. In: Talk at International Workshop on Mathematics of Constraint Satisfaction, Oxford (2006)

[4]

Atserias, A., Bulatov, A., Dawar, A.: Affine systems of equations and counting infinitary logic. In: Proc. 34th International Colloquium on Automata, Languages and Programming. LNCS, vol. 4596, pp. 558-570. Springer, Heidelberg (2007)

Digital Library

[5]

Atserias, A., Dawar, A., Grohe, M.: Preservation under extensions on well-behaved finite structures. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1437-1449. Springer, Heidelberg (2005)

Digital Library

[6]

Atserias, A., Dawar, A., Kolaitis, P.G.: On preservation under homomorphisms and unions of conjunctive queries. Journal of the ACM 53, 208-237 (2006)

Digital Library

[7]

Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational databases. In: Proc. 9th ACM Symp. on Theory of Computing, pp. 77-90 (1977)

Digital Library

[8]

Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)

[9]

Feder, T., Vardi, M.Y.: Computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal of Computing 28, 57-104 (1998)

Digital Library

[10]

Feder, T., Vardi, M.Y.: Homomorphism closed vs existential positive. In: Proc. of the 18th IEEE Symp. on Logic in Computer Science, pp. 311-320 (2003)

Digital Library

[11]

Grohe, M.: Logic, graphs, and algorithms. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and Automata History and Perspectives, Amsterdam University Press (2007)

[12]

Hodges, W.: Model Theory. Cambridge University Press, Cambridge (1993)

[13]

Immerman, N.: Relational queries computable in polynomial time. Information and Control 68, 86-104 (1986)

Digital Library

[14]

Kolaitis, P.G., Vardi, M.Y.: Conjunctive query containment and constraint satisfaction. Journal of Computer and System Sciences 61, 302-332 (2000)

Digital Library

[15]

Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic 126, 159-213 (2004)

[16]

Moschovakis, Y.N.: Elementary Induction on Abstract Structures. North Holland, Amsterdam (1974)

Digital Library

[17]

Rossman, B.: Existential positive types and preservation under homomorphisisms. In: 20th IEEE Symposium on Logic in Computer Science, pp. 467-476 (2005)

Digital Library

[18]

Vardi, M.Y.: The complexity of relational query languages. In: Proc. of the 14th ACM Symp. on the Theory of Computing, pp. 137-146 (1982)

Digital Library

Cited By

Feng S(2023)The Expressive Power of Revised Datalog on Problems with Closure PropertiesLogic, Rationality, and Interaction10.1007/978-3-031-45558-2_9(109-125)Online publication date: 26-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-45558-2_9
Ameloot TKetsman BNeven FZinn D(2017)Datalog Queries Distributing over ComponentsACM Transactions on Computational Logic10.1145/302274318:1(1-35)Online publication date: 22-Feb-2017
https://dl.acm.org/doi/10.1145/3022743
Rudolph SThomazo M(2016)Expressivity of datalog variantsProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence10.5555/3060621.3060792(1230-1236)Online publication date: 9-Jul-2016
https://dl.acm.org/doi/10.5555/3060621.3060792
Show More Cited By

Recommendations

Disjunctive datalog

We consider disjunctive Datalog, a powerful database query language based on disjunctive logic programming. Briefly, disjunctive Datalog is a variant of Datalog where disjunctions may appear in the rule heads; advanced versions also allow for negation in ...
Datalog LITE: a deductive query language with linear time model checking

We present Datalog LITE, a new deductive query language with a linear-time model-checking algorithm, that is, linear time data complexity and program complexity. Datalog LITE is a variant of Datalog that uses stratified negation, restricted variable ...
Datalog vs. first-order logic
SFCS '89: Proceedings of the 30th Annual Symposium on Foundations of Computer Science

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 ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ICALP '08: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II

July 2008

726 pages

ISBN:9783540705826

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 07 July 2008

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Feng S(2023)The Expressive Power of Revised Datalog on Problems with Closure PropertiesLogic, Rationality, and Interaction10.1007/978-3-031-45558-2_9(109-125)Online publication date: 26-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-45558-2_9
Ameloot TKetsman BNeven FZinn D(2017)Datalog Queries Distributing over ComponentsACM Transactions on Computational Logic10.1145/302274318:1(1-35)Online publication date: 22-Feb-2017
https://dl.acm.org/doi/10.1145/3022743
Rudolph SThomazo M(2016)Expressivity of datalog variantsProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence10.5555/3060621.3060792(1230-1236)Online publication date: 9-Jul-2016
https://dl.acm.org/doi/10.5555/3060621.3060792
Rudolph SThomazo M(2015)Characterization of the expressivity of existential rule queriesProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832581.2832694(3193-3199)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832581.2832694
Ameloot TKetsman BNeven FZinn D(2015)Weaker Forms of Monotonicity for Declarative NetworkingACM Transactions on Database Systems10.1145/280978440:4(1-45)Online publication date: 22-Dec-2015
https://dl.acm.org/doi/10.1145/2809784
Ameloot TKetsman BNeven FZinn DHull RGrohe M(2014)Weaker forms of monotonicity for declarative networkingProceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/2594538.2594541(64-75)Online publication date: 18-Jun-2014
https://dl.acm.org/doi/10.1145/2594538.2594541

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents