Complexity of Two-Variable Logic on Finite Trees
Verification of properties expressed in the two-variable fragment of first-order logic FO2 has been investigated in a number of contexts. The satisfiability problem for FO2 over arbitrary structures is known to be NEXPTIME-complete, with satisfiable formulas having exponential-sized models. Over words, where FO2 is known to have the same expressiveness as unary temporal logic, satisfiability is again NEXPTIME-complete. Over finite labelled ordered trees FO2 has the same expressiveness as navigational XPath, a popular query language for XML documents. Prior work on XPath and FO2 gives a 2EXPTIME bound for satisfiability of FO2 over trees. This work contains a comprehensive analysis of the complexity of FO2 on trees, and on the size and depth of models. We show that the exact complexity varies according to the vocabulary used, the presence or absence of a schema, and the encoding of labels on trees. We also look at a natural restriction of FO2, its guarded version, GF2. Our results depend on an analysis of types in models of FO2 formulas, including techniques for controlling the number of distinct subtrees, the depth, and the size of a witness to satisfiability for FO2 sentences over finite trees.
Unable to display preview. Download preview PDF.
- [BBLW13]Benaim, S., Benedikt, M., Lenhardt, R., Worrell, J.: Controlling the depth, size, and number of subtrees in two variable logic over trees. CoRR abs/1304.6925 (2013)Google Scholar
- [BLW12]Benedikt, M., Lenhardt, R., Worrell, J.: Verification of two-variable logic revisited. In: QEST, pp. 114–123. IEEE (2012)Google Scholar
- [BMSS09]Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. J. ACM 56(3) (2009)Google Scholar
- [CKM13]Charatonik, W., Kieroński, E., Mazowiecki, F.: Satisfiability of the two-variable fragment of first-order logic over trees. CoRR abs/1304.7204 (2013)Google Scholar
- [CW13]Charatonik, W., Witkowski, P.: Two-variable logic with counting and trees. In: LICS. IEEE (to appear, 2013)Google Scholar
- [Fig12]Figueira, D.: Satisfiability for two-variable logic with two successor relations on finite linear orders. CoRR abs/1204.2495 (2012)Google Scholar
- [MdR04]Marxand, M., de Rijke, M.: Semantic characterization of navigational XPath. In: TDM. CTIT Workshop Proceedings Series, pp. 73–79 (2004)Google Scholar
- [ST13]Szwast, W., Tendera, L.: FO2 with one transitive relation is decidable. In: STACS. LIPIcs, vol. 20, pp. 317–328, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)Google Scholar
- [Sto74]Stockmeyer, L.J.: The Complexity of Decision Problems in Automata Theory and Logic. PhD thesis, Massachusetts Institute of Technology (1974)Google Scholar
- [Tho97]Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Springer (1997)Google Scholar
- [Wei11]Weis, P.: Expressiveness and Succinctness of First-Order Logic on Finite Words. PhD thesis, University of Massachusetts (2011)Google Scholar