28 search results - page 1 / 6 » Logics for Unranked Trees: An Overview |
ICALP
2005
Springer
13 years 9 months ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
MST
2011
12 years 11 months ago
2011
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
RTA
2004
Springer
13 years 9 months ago
2004
Springer
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...
CSL
2008
Springer
13 years 6 months ago
2008
Springer
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 logic...
CSL
2007
Springer
13 years 10 months ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...