We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is...
We consider the recently proposed XQL language, which is designed to query XML documents by content and structure. We show that an already existing model, namely \Proximal Nodes&q...
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...
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...
W3C currently extends the SPARQL query language with so-called entailment regimes, which define how queries are evaluated using logical entailment relations. We describe a sound a...