4 search results - page 1 / 1 » A Study of a Positive Fragment of Path Queries: Expressivene... |
BNCOD
2009
13 years 5 months ago
2009
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
JACM
2008
13 years 4 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
LICS
2002
IEEE
13 years 9 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...
IANDC
2006
13 years 4 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...