The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey

  • Thomas Eiter
  • Georg Gottlob
  • Thomas Schwentick
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6300)

Abstract

In this paper, we survey results related to the model checking problem for second-order logic over classes of finite structures, including word structures (strings), graphs, and trees, with a focus on prefix classes, that is, where all quantifiers (both first- and second-order ones) are at the beginning of formulas. A complete picture of the prefix classes defining regular and non-regular languages over strings is known, which nearly completely coincides with the tractability frontier; some complexity issues remain to be settled, though. Over graphs and arbitrary relational structures, the tractability frontier is completely delineated for the existential second-order fragment, while it is less explored for trees. Besides surveying some of the results, we mention some open issues for research.

Keywords

Finite Model Theory Gurevich’s Classifiability Theorem Model Checking Monadic Second-Order Logic Regular Languages Second-Order Logic 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (1999)Google Scholar
  2. 2.
    Barbanchon, R., Grandjean, E.: The minimal logically-defined NP-complete problem. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 338–349. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. 3.
    Basin, D., Klarlund, N.: Hardware verification using monadic second-order logic. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 31–41. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  4. 4.
    Baumgartner, R., Flesca, S., Gottlob, G.: Visual web information extraction with Lixto. In: VLDB, pp. 119–128 (2001)Google Scholar
  5. 5.
    Bodlaender, H.L.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM Journal on Computing 25, 1305–1317 (1996)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (1997)CrossRefMATHGoogle Scholar
  7. 7.
    Brüggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over non-ranked alphabets: Version 1, April 3, 2001. Technical Report HKUST-TCSC-2001-05, Hong Kong University of Science and Technology, Hong Kong SAR, China (2001)Google Scholar
  8. 8.
    Büchi, J.R.: On a Decision Method in Restriced Second-Order Arithmetic. In: Nagel, E., et al. (eds.) Proc. International Congress on Logic, Methodology and Philosophy of Science, pp. 1–11. Stanford University Press, Stanford (1960)Google Scholar
  9. 9.
    Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 6, 66–92 (1960)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (Web book) (2008), http://tata.gforge.inria.fr/ (viewed September 25, 2009)
  11. 11.
    Courcelle, B.: The Monadic Second-Order Logic of Graphs I: Recognizable Sets of Finite Graphs. Information and Computation 85, 12–75 (1990)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Doner, J.: Tree acceptors and some of their applications. Journal of Computer and System Sciences 4, 406–451 (1970)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Ebbinghaus, H.D., Flum, J.: Finite Model Theory. In: Perspectives in Mathematical Logic. Springer, Heidelberg (1995)Google Scholar
  14. 14.
    Eiter, T., Gottlob, G., Gurevich, Y.: Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems. Annals of Pure and Applied Logic 78, 111–125 (1996)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Eiter, T., Gottlob, G., Gurevich, Y.: Existential Second-Order Logic over Strings. Journal of the ACM 47, 77–131 (2000)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Eiter, T., Gottlob, G., Schwentick, T.: Second-Order Logic over Strings: Regular and Non-Regular Fragments. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 37–56. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  17. 17.
    Elgaard, J., Klarlund, N., Møller, A.: MONA 1.x: New techniques for WS1S and WS2S. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 516–520. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  18. 18.
    Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society 98, 21–51 (1961)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Fagin, R.: Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In: Karp, R.M. (ed.) Complexity of Computation, pp. 43–74. AMS (1974)Google Scholar
  20. 20.
    Gottlob, G.: Second-order logic over finite structures - report on a research programme. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 229–243. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  21. 21.
    Gottlob, G., Koch, C.: Monadic queries over tree-structured data. In: LICS, pp. 189–202 (2002)Google Scholar
  22. 22.
    Gottlob, G., Koch, C.: Monadic datalog and the expressive power of languages for web information extraction. Journal of the ACM 51, 74–113 (2004)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Gottlob, G., Koch, C., Baumgartner, R., Herzog, M., Flesca, S.: The Lixto data extraction project - back and forth between theory and practice. In: PODS, pp. 1–12 (2004)Google Scholar
  24. 24.
    Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. ACM Trans. Database Syst. 30, 444–491 (2005)CrossRefGoogle Scholar
  25. 25.
    Gottlob, G., Kolaitis, P., Schwentick, T.: Existential second-order logic over graphs: Charting the tractability frontier. In: 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), Redondo Beach, California, USA, November 12-14, pp. 664–674. IEEE Computer Society Press, Los Alamitos (2000)CrossRefGoogle Scholar
  26. 26.
    Gottlob, G., Kolaitis, P., Schwentick, T.: Existential second-order logic over graphs: Charting the tractability frontier. Journal of the ACM 51, 312–362 (2004)MathSciNetCrossRefMATHGoogle Scholar
  27. 27.
    Gottlob, G., Pichler, R., Wei, F.: Monadic datalog over finite structures with bounded treewidth. In: PODS, pp. 165–174 (2007)Google Scholar
  28. 28.
    Grädel, E., Rosen, E.: Two-Variable Descriptions of Regularity. In: Proceedings 14th Annual Symposium on Logic in Computer Science (LICS 1999), Trento, Italy, July 2-5, pp. 14–23. IEEE Computer Science Press, Los Alamitos (1999)Google Scholar
  29. 29.
    Grandjean, E.: Universal quantifiers and time complexity of random access machines. Mathematical Systems Theory 13, 171–187 (1985)MathSciNetCrossRefMATHGoogle Scholar
  30. 30.
    Hachaïchi, Y.: Fragments of monadic second-order logics over word structures. Electr. Notes Theor. Comput. Sci. 123, 111–123 (2005)MathSciNetCrossRefGoogle Scholar
  31. 31.
    Henriksen, J., Jensen, J., Jørgensen, M., Klarlund, N., Paige, B., Rauhe, T., Sandholm, A.: Mona: Monadic second-order logic in practice. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 89–110. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  32. 32.
    Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1999)CrossRefMATHGoogle Scholar
  33. 33.
    Kolaitis, P., Papadimitriou, C.: Some Computational Aspects of Circumscription. Journal of the ACM 37, 1–15 (1990)MathSciNetCrossRefMATHGoogle Scholar
  34. 34.
    Langholm, T., Bezem, M.: A descriptive characterisation of even linear languages. Grammars 6, 169–181 (2003)MathSciNetCrossRefMATHGoogle Scholar
  35. 35.
    Lautemann, C., Schwentick, T., Thérien, D.: Logics for context-free languages. In: Proc. 1994 Annual Conference of the EACSL, pp. 205–216 (1995)Google Scholar
  36. 36.
    Leivant, D.: Descriptive Characterizations of Computational Complexity. Journal of Computer and System Sciences 39, 51–83 (1989)MathSciNetCrossRefMATHGoogle Scholar
  37. 37.
    Lynch, J.F.: The quantifier structure of sentences that characterize nondeterministic time complexity. Computational Complexity 2, 40–66 (1992)MathSciNetCrossRefMATHGoogle Scholar
  38. 38.
    McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)MATHGoogle Scholar
  39. 39.
    Neven, F., Schwentick, T.: Query automata on finite trees. Theoretical Computer Science 275, 633–674 (2002)MathSciNetCrossRefMATHGoogle Scholar
  40. 40.
    Olive, F.: A Conjunctive Logical Characterization of Nondeterministic Linear Time. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414. Springer, Heidelberg (1997) (to appear)Google Scholar
  41. 41.
    Pin, J.E.: Varieties of Formal Languages. North Oxford/Plenum, London/New York (1986)Google Scholar
  42. 42.
    Pin, J.E.: Logic On Words. Bulletin of the EATCS 54, 145–165 (1994)MATHGoogle Scholar
  43. 43.
    Pin, J.E.: Semigroups and Automata on Words. Annals of Mathematics and Artificial Intelligence 16, 343–384 (1996)MathSciNetCrossRefMATHGoogle Scholar
  44. 44.
    Stockmeyer, L.J.: The Polynomial-Time Hierarchy. Theoretical Computer Science 3, 1–22 (1977)MathSciNetCrossRefMATHGoogle Scholar
  45. 45.
    Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Basel (1994)CrossRefMATHGoogle Scholar
  46. 46.
    Straubing, H., Thérien, D., Thomas, W.: Regular Languages Defined with Generalized Quantifiers. Information and Computation 118, 289–301 (1995)MathSciNetCrossRefMATHGoogle Scholar
  47. 47.
    Thatcher, J., Wright, J.: Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2, 57–81 (1968)MathSciNetCrossRefMATHGoogle Scholar
  48. 48.
    Thomas, W.: Automata on Infinite Objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B. Elsevier Science Publishers B.V, North-Holland (1990)Google Scholar
  49. 49.
    Thomas, W.: Languages, Automata, and Logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language Theory, vol. III, pp. 389–455. Springer, Heidelberg (1996)Google Scholar
  50. 50.
    Thomassen, C.: On the Presence of Disjoint Subgraphs of a Specified Type. Journal of Graph Theory 12, 101–111 (1988)MathSciNetCrossRefMATHGoogle Scholar
  51. 51.
    Trakhtenbrot, B.: Finite Automata and the Logic of Monadic Predicates. Dokl. Akad. Nauk SSSR 140, 326–329 (1961)Google Scholar
  52. 52.
    World Wide Web Consortium: XPath recomendation (1999), http://www.w3c.org/TR/xpath/ (viewed September 25, 2009)

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Thomas Eiter
    • 1
  • Georg Gottlob
    • 2
  • Thomas Schwentick
    • 3
  1. 1.Institute of Information SystemsVienna University of TechnologyAustria
  2. 2.Computing LaboratoryOxford UniversityUnited Kingdom
  3. 3.Fakultät für InformatikTechnische Universität DortmundGermany

Personalised recommendations