56 search results - page 3 / 12 » Characterizing Data Complexity for Conjunctive Query Answeri... |
JAPLL
2010
13 years 4 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
DLOG
2007
13 years 8 months ago
2007
An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we present a decision procedure for conjunctive query...
PODS
1998
ACM
13 years 10 months ago
1998
ACM
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
DLOG
2007
13 years 8 months ago
2007
Abstract. Fuzzy Description Logics (f-DLs) have been proposed as formalisms capable of capturing and reasoning about imprecise and vague knowledge. The last years, research in Desc...
AMW
2010
13 years 7 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...