47 search results - page 3 / 10 » The expressivity of XPath with transitive closure |
PODS
2000
ACM
13 years 10 months ago
2000
ACM
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
ENTCS
2006
13 years 5 months ago
2006
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
LICS
2009
IEEE
14 years 14 days ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
LICS
1995
IEEE
13 years 9 months ago
1995
IEEE
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
TACAS
2009
Springer
14 years 18 days ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...