Add to ORKGWe study query answering in the description logic SQ supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for SQ-knowledge bases and, building upon this, an optimal automata-based algorithm for answering positive existential regular path queries in 2EXPTIME
With the adoption of the recent SPARQL 1.1 standard, RDF databases are capable of directly answering...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
Conjunctive regular path queries are an expressive extension of the well-known class of conjunctive ...
We study query answering in the description logic SQ supporting qualified number restrictions on bot...
We study query answering in the description logic SQ supporting number restrictions on both transit...
A prime application of description logics is ontology-mediated query answering, with the query langu...
International audienceOntology-mediated query answering is concerned with the problem of answering q...
Abstract. Regular path queries (RPQs) define query patterns in terms of regu-lar expressions and are...
Abstract. Regular path queries (RPQs) define query patterns in terms of regu-lar expressions and are...
International audienceIn the setting of ontology-mediated query answering, a query is evaluated over...
Current information systems are required to deal with more complex data with respect to traditional ...
Classical regular path queries (RPQs) can be too restrictive for some applications and answering suc...
The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able...
In this paper we study query answering over ontologies expressed in Datalog+/–, i.e., datalog with e...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
With the adoption of the recent SPARQL 1.1 standard, RDF databases are capable of directly answering...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
Conjunctive regular path queries are an expressive extension of the well-known class of conjunctive ...
We study query answering in the description logic SQ supporting qualified number restrictions on bot...
We study query answering in the description logic SQ supporting number restrictions on both transit...
A prime application of description logics is ontology-mediated query answering, with the query langu...
International audienceOntology-mediated query answering is concerned with the problem of answering q...
Abstract. Regular path queries (RPQs) define query patterns in terms of regu-lar expressions and are...
Abstract. Regular path queries (RPQs) define query patterns in terms of regu-lar expressions and are...
International audienceIn the setting of ontology-mediated query answering, a query is evaluated over...
Current information systems are required to deal with more complex data with respect to traditional ...
Classical regular path queries (RPQs) can be too restrictive for some applications and answering suc...
The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able...
In this paper we study query answering over ontologies expressed in Datalog+/–, i.e., datalog with e...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
With the adoption of the recent SPARQL 1.1 standard, RDF databases are capable of directly answering...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
Conjunctive regular path queries are an expressive extension of the well-known class of conjunctive ...