The complexity of datalog on linear orders

Logical Methods in Computer Science

Volumn 5, Issue 1, 2009, Pages 1-21

  Grohe, Martin ^a   Schwandtner, Goetz ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

Boundedness; Complexity; Datalog; Infinite structures; Linear orders

Indexed keywords

BOUNDEDNESS; COMPLEXITY; DATALOG; FINITE STRUCTURES; INFINITE STRUCTURE; LINEAR ORDER; PROGRAM COMPLEXITY; UPPER BOUND;

EID: 78549264101     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-5(1:4)2009     Document Type: Article

References (23)

1. S. Abiteboul. Boundedness is undecidable for datalog programs with a single recursive rule. Information Processing Letters, 32:281-287, 1989.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
3. James F. Allen. Maintaining knowledge about temporal intervals. Comm. ACM, 26:832-843, 1982.
4. M. Bodirsky and V. Dalmau. Datalog and constraint satisfaction with infinite templates. In B. Durand andW. Thomas, editors, Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, volume 3884 of Lecture Notes in Computer Science, pages 646-659. Springer-Verlag, 2006.
5. M. Bodirsky and J. Něseťril. Constraint satisfaction with countable homogeneous templates. Journal of Logic and Computation, 16:359-373, 2006.
6. S. Chaudhuri and M.Y. Vardi. On the equivalence of recursive and nonrecursive datalog programs. In Proceedings of the 11th ACM Symposium on Principles of Database Systems, pages 55-66, 1992.
7. S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi. Decidable optimization problems for database logic programs (preliminary report). In Proceedings of the 20th ACM Symposium on Theory of Computing, pages 477-490, 1988.
8. Evgeny Dantsin, Thomas Eiter, Georg Gottlob, and Andrei Voronkov. Complexity and expressive power of logic programming. In IEEE Conference on Computational Complexity, pages 82-101, 1997.
9. L.E. Dickson. Finiteness of the odd perfect and primitive abundant numbers with discitnct factors. American Journal of Mathematics, 3:413-422, 1913.
10. R. Diestel. Graphentheorie. Springer, Berlin, second edition, 2000.
11. H. Gaifman, H. Mairson, Y. Sagiv, and M.Y. Vardi. Undecidable optimization problems for database logic programs. Journal of the ACM, 40(3):683-713, 1993.
12. G. Gottlob and Ch. Koch. Monadic datalog and the expressive power of web information extraction languages. Journal of the ACM, 51(1):74-113, 2004.
13. G. Gottlob and C. H. Papadimitriou. On the complexity of single-rule datalog queries. Inf. Comput., 183(1):104-122, 2003.
14. W. Harwood, F. Moller, and A. Setzer. Weak bisimulation approximants. In Proceedings of CSL'06, LNCS, pages 365-379, Szeged, Hungary, 2006.
15. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, and Moshe Y. Vardi. Undecidable boundedness problems for datalog programs. Journal of Logic Programming, 25(2):163-190, 1995.
16. Wilfrid Hodges. A shorter model theory. Cambridge University Press, New York, NY, USA, 1997.
17. P.C. Kanellakis. Elements of relational database theory. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers B.v., 1990.
18. Ph.G. Kolaitis and M.Y. Vardi. On the expressive power of datalog: tools and a case study. Journal of Computer and System Sciences, 51(1):110-134, 1995.
19. Andrei Krokhin, Peter Jeavons, and Peter Jonsson. Constraint satisfaction problems on intervals and lengths. Siam J. Discrete Math., 17(3):453-477, 2004.
20. I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence, 87:343-385, 1996.
21. B. Nebel and Hans-J̈urgen B̈urckert. Reasoning about temporal relations: a maximal tractable subclass of allen's interval algebra. Journal of the ACM, 42, 1995.
22. G. Schwandtner. Datalog on Infinite Structures. PhD thesis, Humboldt-Universiẗat zu Berlin, 2008.
23. M.Y. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing, pages 137-146, 1982.