Issue Theoret. Informatics Appl. Volume 38, Number 4, October-December 2004 Fixed Points in Computer Science (FICS'03) Page(s) 343 - 373 DOI 10.1051/ita:2004017

Theoret. Informatics Appl. 38, 343-373 (2004)
DOI: 10.1051/ita:2004017

Comparing the succinctness of monadic query languages over finite trees

Martin Grohe and Nicole Schweikardt

Institut für Informatik, Humboldt-Universität Berlin, Germany; grohe@informatik.hu-berlin.de.; schweika@informatik.hu-berlin.de.

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.

Mathematics Subject Classification. 03B70, 68P15, 68Q45


© EDP Sciences 2004

What is OpenURL?