25 search results - page 2 / 5 » Conjunctive Query Containment in Description Logics with n-a... |
PODS
2000
ACM
13 years 9 months ago
2000
ACM
The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting ...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
DLOG
2008
13 years 7 months ago
2008
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
CADE
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. I...
KR
2010
Springer
13 years 8 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...