RAIRO-Theor. Inf. Appl.
Volume 38, Number 4, October-December 2004Fixed Points in Computer Science (FICS'03)
|Page(s)||343 - 373|
|Published online||15 October 2004|
Comparing the succinctness of monadic query languages over finite trees
Institut für Informatik,
Humboldt-Universität Berlin, Germany; email@example.com.; firstname.lastname@example.org.
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.
Mathematics Subject Classification: 03B70 / 68P15 / 68Q45
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.