109 search results - page 6 / 22 » Exploiting Conjunctive Queries in Description Logic Programs |
JSC
2010
14 years 8 months ago
2010
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...
AMW
2010
14 years 11 months ago
2010
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
DEXAW
2008
IEEE
14 years 11 months ago
2008
IEEE
With the increasing development of real applications using Semantic Web Technologies, it is necessary to provide scalable and efficient ontology querying and reasoning systems. In ...
115
click to vote
KR
2010
Springer
15 years 1 months ago
2010
Springer
The DL-Lite family of Description Logics has been designed with the specific goal of allowing for answering complex queries (in particular, conjunctive queries) over ontologies w...
LPAR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The coupling of description logic reasoning systems with other reasoning formalisms (possibly over the Web) is becoming an important research issue and calls for advanced...