Towards top-k query answering in description logics: The case of DL-Lite

被引：27
作者：
Straccia, Umberto [1 ]
机构：
[1] CNR, ISTI, I-56100 Pisa, Italy
来源：
LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS | 2006年 / 4160卷
关键词：
D O I：
10.1007/11853886_36
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We address the problem of evaluating ranked top-k queries in description logics. The problem occurs whenever we allow queries such as "find cheap hotels close to the conference location" in which fuzzy predicates like cheap and close occur. We show how to efficiently compute the top-k answers of conjunctive queries with fuzzy predicates over DL-LITE like knowledge bases.
引用
收藏
页码：439 / 451
页数：13
相关论文
共 23 条
  • [1] [Anonymous], 2006, Fuzzy Logic and the Semantic Web, Capturing Intelligence, DOI 10.1016/S1574-9576(06)80006-7
  • [2] Baader F., 2003, DESCRIPTION LOGIC HD
  • [3] Baader F, 2005, 19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), P364
  • [4] CALI A, 2003, P 18 INT JOINT C ART, P16
  • [5] CALVANESE D, 2005, P 20 NAT C ART INT A
  • [6] CALVANESE D, 2005, P 2005 INT WORKSH DE
  • [7] CHEN CM, 2005, P 2005 INT WORKSH DE
  • [8] Optimal aggregation algorithms for middleware
    Fagin, R
    Lotem, A
    Naor, M
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (04) : 614 - 656
  • [9] Fagin R, 2002, SIGMOD REC, V31, P109
  • [10] Guntzer U., 2000, VLDB, P419
123