432 search results - page 6 / 87 » On Notions of Regularity for Data Languages |
SEMWEB
2010
Springer
13 years 5 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
ICALP
2010
Springer
14 years 10 days ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
ADBIS
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we describe an approach to representation of data and knowledge using two technologies: XML and regular expressions in a domain of natural language syntactic analysis...
JUCS
2010
13 years 6 months ago
2010
: A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be written in a unique way as a concatenation of a word in L1 and a word in L2. The not...
FQAS
2009
Springer
14 years 2 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...