109 search results - page 4 / 22 » Characterization of Logics over Ranked Tree Languages |
MST
2010
13 years 4 months ago
2010
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
LICS
2002
IEEE
13 years 11 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
SAS
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
DOCENG
2004
ACM
13 years 11 months ago
2004
ACM
In this paper, we discuss how to present the result of searching elements of any type from XML documents relevant to some information need (relevance-oriented search). As the resu...
PODS
1997
ACM
13 years 10 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...