Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CSL
2008
Springer

favoriteEmaildiscussreport

134views Automated Reasoning» more CSL 2008»

Characterization of Logics over Ranked Tree Languages

13 years 6 months ago

Characterization of Logics over Ranked Tree Languages

Download www.lsv.ens-cachan.fr

We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logics using algebraic identities. Characterizations had already been obtained for those logics over unranked trees, but both the algebra and the proofs were dependant on the properties of the unranked structure and the problem remained open for ranked trees.

Thomas Place

Real-time Traffic

Automated Reasoning | CSL 2008 | Effective Characterizations | Logics | Logics Ef |

claim paper

Related Content

» Tree Languages Defined in FirstOrder Logic with One Quantifier Alternation

» Wreath Products of Forest Algebras with Applications to Tree Logics

» Characterizing EF and EX Tree Logics

» Effective characterizations of tree logics

» Algebraic Characterization of Logically Defined Tree Languages

» Monadic SecondOrder Logic and Transitive Closure Logics over Trees

» Comparing the Succinctness of Monadic Query Languages over Finite Trees

» Polynomials Fragments of Temporal Logic and the Variety DA over Traces

» A Descriptive Characterization of TreeAdjoining Languages Project Note

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	CSL
Authors	Thomas Place

Comments (0)