47 search results - page 6 / 10 » The expressivity of XPath with transitive closure |
ACTA
2002
13 years 7 months ago
2002
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
ACTA
2007
13 years 7 months ago
2007
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...
SYNTHESE
2008
13 years 7 months ago
2008
Dynamic Epistemic Logic (DEL) is the study of how to reason about knowledge, belief, and communication. This paper studies the relative expressivity of certain fragments of the DE...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...