Comparing the succinctness of monadic query languages over finite trees
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004) no. 4, pp. 343-373.

Voir la notice de l'article dans Numdam

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.

DOI : 10.1051/ita:2004017
Classification : 03B70, 68P15, 68Q45 
@article{ITA_2004__38_4_343_0,
     author = {Grohe, Martin and Schweikardt, Nicole},
     title = {Comparing the succinctness of monadic query languages over finite trees},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {343--373},
     publisher = {EDP-Sciences},
     volume = {38},
     number = {4},
     year = {2004},
     doi = {10.1051/ita:2004017},
     zbl = {1067.03018},
     mrnumber = {2098195},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2004017/}
}
TY  - JOUR
AU  - Grohe, Martin
AU  - Schweikardt, Nicole
TI  - Comparing the succinctness of monadic query languages over finite trees
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2004
SP  - 343
EP  - 373
VL  - 38
IS  - 4
PB  - EDP-Sciences
UR  - https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2004017/
DO  - 10.1051/ita:2004017
LA  - en
ID  - ITA_2004__38_4_343_0
ER  - 
%0 Journal Article
%A Grohe, Martin
%A Schweikardt, Nicole
%T Comparing the succinctness of monadic query languages over finite trees
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2004
%P 343-373
%V 38
%N 4
%I EDP-Sciences
%U https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2004017/
%R 10.1051/ita:2004017
%G en
%F ITA_2004__38_4_343_0
Grohe, Martin; Schweikardt, Nicole. Comparing the succinctness of monadic query languages over finite trees. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004) no. 4, pp. 343-373. doi : 10.1051/ita:2004017. https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2004017/

Cité par Sources :