Comparing the succinctness of monadic query languages over finite trees
Authors:
- 15 October 2004
- journal article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 38 (4) , 343-373
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 parameterised complexity of query evaluation for these languages.Keywords
This publication has 17 references indexed in Scilit:
- Monadic datalog and the expressive power of languages for Web information extractionJournal of the ACM, 2004
- An n ! lower bound on formula sizeACM Transactions on Computational Logic, 2003
- Comparing the Succinctness of Monadic Query Languages over Finite TreesLecture Notes in Computer Science, 2003
- First-Order Logic with Two Variables and Unary Temporal LogicInformation and Computation, 2002
- A deterministic (2−2/(k+1))n algorithm for k-SAT based on local searchTheoretical Computer Science, 2002
- An Algebra for XML QueryLecture Notes in Computer Science, 2000
- Reachability logic: an efficient fragment of transitive closure logicLogic Journal of the IGPL, 2000
- On logics with two variablesTheoretical Computer Science, 1999
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Monadic generalized spectraMathematical Logic Quarterly, 1975