skip to main content
10.1145/1559795.1559807acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
tutorial

The finite model theory toolbox of a database theoretician

Published:29 June 2009Publication History

ABSTRACT

For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By now, finite model theory has built a large arsenal of tools that can easily be used by database theoreticians without going to the basics such as combinatorial games. We survey such tools here, focusing not on how they are proved, but rather on how to apply them, as-is, in various questions that come up in database theory.

References

  1. M. Ajtai. Sigma11 formulae on finite structures. Annals of Pure and Applied Logic, 24 (1983), 1--48.Google ScholarGoogle ScholarCross RefCross Ref
  2. A. Blass, Y. Gurevich, and D. Kozen. A zero-one law for logic with a fixed-point operator. Information and Control, 67 (1985), 70--90. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, L. Segoufin. Two-variable logic on data trees and XML reasoning. In PODS'06, pages 10--19. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Chandra and D. Harel. Computable queries for relational databases. Journal of Computer and System Sciences, 21 (1980), 156--178.Google ScholarGoogle ScholarCross RefCross Ref
  5. A. Dawar, S. Lindell, and S. Weinstein. Infinitary logic and inductive definability over finite structures. Information and Computation, 119 (1995), 160--175. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. G. Dong, L. Libkin, and L. Wong. Local properties of query languages. Theoretical Computer Science, 239 (2000), 277--308. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.Google ScholarGoogle Scholar
  8. R. Fagin. Monadic generalized spectra. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, 21 (1975), 89--96.Google ScholarGoogle Scholar
  9. R. Fagin. Probabilities on finite models. Journal of Symbolic Logic, 41 (1976), 50--58.Google ScholarGoogle Scholar
  10. R. Fagin, L. Stockmeyer, and M.Y. Vardi. On monadic NP vs monadic co-NP. Information and Computation, 120 (1994), 78--92. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Frick and M. Grohe. The complexity of first-order and monadic second-order logic revisited. In IEEE Symp. on Logic in Computer Science, 2002, pages 215--224. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. H. Gaifman. On local and non-local properties, Proc.Herbrand Symp., Logic Colloquium '81. North-Holland, 1982.Google ScholarGoogle ScholarCross RefCross Ref
  13. G. Gottlob and C. Koch. Monadic datalog and the expressive power of languages for Web information extraction. Journal of the ACM, 51 (2004), 74--113. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. E. Graedel, Ph. Kolaitis, L. Libkin, M. Marx, J. Spencer, M.Y. Vardi, Y. Venema, S. Weinstein. Finite Model Theory and its Applications. Springer-Verlag, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. Grohe. Parameterized complexity for the database theorist. SIGMOD Record, 31 (2002), 86--96. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. Grohe. Logic, graphs, and algorithms. In Logic and Automata -- History and Perspectives, Amsterdam Univ. Press, 2007.Google ScholarGoogle Scholar
  17. M. Grohe and T. Schwentick. Locality of order-invariant first-order formulas. ACM Transactions on Computational Logic, 1 (2000), 112--130. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173 (1997), 151--181. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Y. Gurevich. Logic and the challenge of computer science. In Current trends in theoretical computer science, E. Borger, ed., Computer Science Press, 1988, pages 1--57.Google ScholarGoogle Scholar
  20. W. Hanf. Model-theoretic methods in the study of elementary logic. In The Theory of Models, North-Holland, 1965, pages 132--145.Google ScholarGoogle Scholar
  21. L. Hella, L. Libkin, and J. Nurmonen. Notions of locality and their logical characterizations over finite models. Journal of Symbolic Logic, 64 (1999), 1751--1773.Google ScholarGoogle ScholarCross RefCross Ref
  22. L. Hella, L. Libkin, J. Nurmonen, and L. Wong. Logics with aggregate operators. Journal of the ACM, 48 (2001), 880--907. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. N. Immerman. Relational queries computable in polynomial time. Information and Control, 68 (1986), 86--104. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. N. Immerman. Descriptive Complexity. Springer, 1998.Google ScholarGoogle Scholar
  25. N. Immerman and E. Lander. Describing graphs: a first order approach to graph canonization. In Complexity Theory Retrospective, Springer-Verlag, Berlin, 1990.Google ScholarGoogle Scholar
  26. G. Kuper, L. Libkin, and J. Paredaens, eds. Constraint Databases. Springer, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. L. Libkin. On counting logics and local properties. ACM Transactions on Computational Logic, 1 (2000), 33--59. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. L. Libkin. Elements of Finite Model Theory. Springer, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. L. Libkin. Logics over unranked trees: an overview. LMCS 2(3): (2006).Google ScholarGoogle Scholar
  30. J. Lynch. Almost sure theories. Annals of Mathematical Logic, 18 (1980), 91--135.Google ScholarGoogle ScholarCross RefCross Ref
  31. J. Makowsky. Algorithmic aspects of the Feferman-Vaught Theorem. Annals of Pure and Applied Logic, 126 (2004), 159--213.Google ScholarGoogle ScholarCross RefCross Ref
  32. H. Niemisto. Locality and order-invariant logics. PhD Thesis, Univ.of Helsinki, 2007.Google ScholarGoogle Scholar
  33. F. Neven, Th. Schwentick. Query automata over finite trees. TCS 275 (2002), 633--674. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. J. Nurmonen. On winning strategies with unary quantifiers. Journal of Logic and Computation, 6 (1996), 779--798.Google ScholarGoogle ScholarCross RefCross Ref
  35. M. Otto. Two variable first-order logic over ordered domains. J. Symb. Logic 66 (2001), 685--702.Google ScholarGoogle ScholarCross RefCross Ref
  36. C. Papadimitriou. A note on the expressive power of Prolog. Bulletin of the EATCS, 26 (1985), 21--23.Google ScholarGoogle Scholar
  37. J. Rosenstein. Linear Orderings. Academic Press, 1982.Google ScholarGoogle Scholar
  38. B. Rossman. On the constant-depth complexity of k-clique. In STOC'08, pages 721--730. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. T. Schwentick. Automata for XML -- a survey. JCSS 73 (2007), 289--315. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. D. Seese. Linear time computable problems and first-order descriptions. Mathematical Structures in Computer Science, 6 (1996), 505--526.Google ScholarGoogle Scholar
  41. B.A. Trakhtenbrot. The impossibilty of an algorithm for the decision problem for finite models. Doklady Academii Nauk SSSR, 70 (1950), 569--572.Google ScholarGoogle Scholar
  42. M.Y. Vardi. The complexity of relational query languages. In Proc.ACM Symp.on Theory of Computing, 1982, 137--146. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. M.Y. Vardi. On the complexity of bounded-variable queries. In ACM Symp. on Principles of Database Systems, ACM Press, 1995, pages 266--276. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. V. Vianu. Databases and finite-model theory. In Descriptive Complexity and Finite Models, Proc. of a DIMACS workshop. AMS, 1997, pages 97--148.Google ScholarGoogle Scholar

Index Terms

  1. The finite model theory toolbox of a database theoretician

          Recommendations

          Comments

          Login options

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

          Sign in
          • Published in

            cover image ACM Conferences
            PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
            June 2009
            298 pages
            ISBN:9781605585536
            DOI:10.1145/1559795
            • General Chair:
            • Jan Paredaens,
            • Program Chair:
            • Jianwen Su

            Copyright © 2009 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 29 June 2009

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • tutorial

            Acceptance Rates

            Overall Acceptance Rate476of1,835submissions,26%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!