SOSNA
Expressive Power of Tree Logics
| Coordinatore | UNIWERSYTET WARSZAWSKI
Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie. |
| Nazionalità Coordinatore | Poland [PL] |
| Totale costo | 799˙920 € |
| EC contributo | 799˙920 € |
| Programma | FP7-IDEAS-ERC
Specific programme: "Ideas" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013) |
| Code Call | ERC-2009-StG |
| Funding Scheme | ERC-SG |
| Anno di inizio | 2009 |
| Periodo (anno-mese-giorno) | 2009-11-01 - 2014-10-31 |
Partecipanti
| # | ||||
|---|---|---|---|---|
| 1 |
UNIWERSYTET WARSZAWSKI
Organization address
address: Krakowskie Przedmiescie 26/28 contact info |
PL (WARSAW) | hostInstitution | 799˙920.00 |
Mappa
Word cloud
Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.
Obiettivo del progetto (Objective)
'Logics for expressing properties of labeled trees and forests figure importantly in several different areas of Computer Science, including verification (branching temporal logics) and database theory (many XML query languages). The goal of this project is to investigate the expressive power of tree logics, mainly those logics that can be captured by tree automata. A similar study, but for word languages, is one of the main lines of research in formal language theory. The study of the expressive power of word logics has lead to many beautiful and fundamental results, including Schutzenberger's characterization of star-free languages, and the Krohn-Rhodes decomposition theorem. We intend to extend this research for trees. The type of questions we want to answer is: what is the expressive power of first-order logic in trees? is there a Krohn-Rhodes decomposition theory for trees? what is a tree group? We expect that our study of tree logics will use algebraic techniques, possibly the setting of forest algebra (as introduced by the principal investigator and Igor Walukiewicz). We would also like to extend the algebraic setting beyond regular languages of finite trees, to e.g. infinite trees, or nonregular languages.'