Abstract
We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive power on trees, but some can express the same queries much more succinctly than others. For example, we show that, under some complexity theoretic assumption, monadic second-order logic is non-elementarily more succinct than monadic least fixed point logic, which in turn is non-elementarily more succinct than monadic datalog.
Succinctness of the languages is closely related to the combined and parameterized complexity of query evaluation for these languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (1999)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of databases. Addison-Wesley, Reading (1995)
Alechina, N., Immerman, N.: Reachability logic: An efficient fragment of transitive closure logic. Logic Journal of the IGPL 8(3), 325–338 (2000)
Adler, M., Immerman, N.: An n! lower bound on formula size. In: Proceedings of the 16th IEEE Symposium on Logic in Computer Science, pp. 197–206 (2001)
Chandra, A., Harel, D.: Structure and complexity of relational queries. Journal of Computer and Systems Sciences 25, 99–128 (1982)
Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Schöning, U.: A deterministic (2 −2/(k+1))n algorithm for k-SAT based on local search. Theoretical Computer Science 289(1), 69–83 (2002); Revised version of: Deterministic algorithms for k-SAT based on covering codes and local search. In: ICALP 2000. LNCS, vol. 1853 (2000)
Ebbinghaus, H.-D., Flum, J.: Finite model theory, 2nd edn. Springer, New York (1999)
Etessami, K., Vardi, M.Y., Wilke, T.: First-order logic with two variables and unary temporal logic. Information and Computation 179(2), 279–295 (2002)
Fagin, R.: Monadic generalized spectra. Zeitschrift für mathematische Logik und Grundlagen der mathematik 21, 89–96 (1975)
Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Journal version of LICS 2002 paper (2003), Available at http://www.dcs.ed.ac.uk/home/grohe/pub.html
Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees. In: 18th IEEE Symposium on Logic in Computer Science (LICS 2003), Ottawa, Canada (June 2003)
Fernandez, M.F., Siméon, J., Wadler, P.: An algebra for XML query. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 11–45. Springer, Heidelberg (2000)
Gottlob, G., Koch, C.: Monadic datalog and the expressive power of web information extraction languages. Journal version of PODS 2002 paper. Available as CoRR report arXiv:cs.DB/0211020 (November 2002) (submitted)
Grädel, E., Otto, M.: On Logics with Two Variables. Theoretical Computer Science 224, 73–113 (1999)
Grohe, M., Schweikardt, N.: Comparing the succinctness of monadic query languages over finite trees. Technical Report EDI-INF-RR-0168, School of Informatics, University of Edinburgh (2003)
Hosoya, H., Pierce, B.C.: XDuce: A typed XML processing language (preliminary report). In: Suciu, D., Vossen, G. (eds.) WebDB 2000. LNCS, vol. 1997, p. 226. Springer, Heidelberg (2001)
Immerman, N.: Descriptive complexity. Springer, New York (1999)
Kamp, H.: Tense Logic and the theory of linear order. PhD thesis, University of California, Los Angeles (1968)
Koch, C.: Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree-automata based approach. In: Proceedings of the 29th Conference on Very Large Data Bases (2003) (to appear)
Neven, F.: Design and Analysis of Query Languages for Structured Documents – A Formal and Logical Approach. PhD thesis, Limburgs Universitair Centrum (1999)
Neven, F., Schwentick, T.: Query automata over finite trees. Theoretical Computer Science 275(1-2), 633–674 (2002); Journal version of PODS 2000 paper
Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of formal languages, vol. 3, Springer, New York (1996)
Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628–641. Springer, Heidelberg (1998)
Wilke, T.: CTL+ is exponentially more succinct than CTL. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 110–121. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grohe, M., Schweikardt, N. (2003). Comparing the Succinctness of Monadic Query Languages over Finite Trees. In: Baaz, M., Makowsky, J.A. (eds) Computer Science Logic. CSL 2003. Lecture Notes in Computer Science, vol 2803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45220-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-45220-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40801-7
Online ISBN: 978-3-540-45220-1
eBook Packages: Springer Book Archive