Sciweavers

1423 search results - page 41 / 285
» Languages of Nested Trees
Sort
View
SIGMOD
2008
ACM
143views Database» more  SIGMOD 2008»
15 years 12 months ago
XML query optimization in the presence of side effects
The emergence of database languages with side effects, notably for XML, raises significant challenges for database compilers and optimizers. In this paper, we extend an algebra fo...
Giorgio Ghelli, Nicola Onose, Kristoffer Hø...
TPHOL
2003
IEEE
15 years 5 months ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd
ACTA
2005
94views more  ACTA 2005»
14 years 11 months ago
The stuttering principle revisited
It is known that LTL formulae without the `next' operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL...
Antonín Kucera, Jan Strejcek
CSL
2008
Springer
15 years 1 months ago
Characterization of Logics over Ranked Tree Languages
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...
Thomas Place
IJFCS
2010
60views more  IJFCS 2010»
14 years 10 months ago
Properties of Quasi-Relabeling Tree Bimorphisms
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is dened by a tree bimorphism (Ï...
Andreas Maletti, Catalin Ionut Tîrnauca