期刊文献+

Querying over Fuzzy Description Logic

Querying over Fuzzy Description Logic
下载PDF
导出
摘要 Description logics (DLs) play an important role in representing and reasoning domain knowledge. Conjunctive queries stemmed from the domain of relational databases, and have attracted more attentions in semantic Web recently. To acquire a tractable DL for query answering, DL-Lite is proposed. Due to the large amount of imprecision and uncertainty in the real world, it is essential to extend DLs to deal with these vague and imprecise information. We thus propose a new fuzzy DL f-DLR-Lite.n, which allows for the presence of n-ary relations and the occurrence of concept conjunction on the left land of inclusion axioms. We also suggest an improved fuzzy query language, which supports the presence of thresholds and user defined weights. We also show that the query answering algorithm over the extended DL is still FOL reducible and shows polynomial data complexity. DL f-DLR-Lite,n can make up for the disadvantages of knowledge representation and reasoning of classic DLs, and the enhanced query language expresses user intentions more precisely and reasonably. Description logics (DLs) play an important role in representing and reasoning domain knowledge. Conjunctive queries stemmed from the domain of relational databases, and have attracted more attentions in semantic Web recently. To acquire a tractable DL for query answering, DL-Lite is proposed. Due to the large amount of imprecision and uncertainty in the real world, it is essential to extend DLs to deal with these vague and imprecise information. We thus propose a new fuzzy DL f-DLR-Lite.n, which allows for the presence of n-ary relations and the occurrence of concept conjunction on the left land of inclusion axioms. We also suggest an improved fuzzy query language, which supports the presence of thresholds and user defined weights. We also show that the query answering algorithm over the extended DL is still FOL reducible and shows polynomial data complexity. DL f-DLR-Lite,n can make up for the disadvantages of knowledge representation and reasoning of classic DLs, and the enhanced query language expresses user intentions more precisely and reasonably.
出处 《Wuhan University Journal of Natural Sciences》 CAS 2008年第4期429-434,共6页 武汉大学学报(自然科学英文版)
基金 the Program for New Century Excellent Talents in University (NCET-05-0288) the Specialized Research Fund for the Doctoral Program of Higher Education of China (20050145024)
关键词 query answering fuzzy set description logics query answering fuzzy set description logics
  • 相关文献

参考文献10

  • 1Baader F,Calvanese D,McGuinness D, et al.The Descrip- tion Logic Handbook: Theory, Implementation and Applica- tions[]..2003
  • 2Brachman R J,Levesque H J.The Tractability of Subsump- tion in Frame-Based Description Languages[].Proc of the th Nat Conf on Artificial Intelligence (AAAI’).1984
  • 3Glimm B,Horrocks I,Sattler U.Conjunctive Query Entailment for SHOQ. http://ceur-ws.org/ . 2006
  • 4Glimm B,Horrocks I,Lutz C, et al.Conjunctive Query An- swering for the Description Logic SHIQ[].Proc of IJCAI.2007
  • 5Calvanese D,Giacomo G D,Lenzerini M, et al.DL-Lite: Practical Reasoning for Rich DLs. http://ceur-ws.org/Vol-104/ . 2006
  • 6Calvanese D,Giacomo G D,Lembo D, et al.DL-Lite: Trac- table Description Logics for Ontologies[].Proc of AAAI.2005
  • 7Calvanese D,Giacomo G D,Lembo D, et al.Data Complex-ity of Query Answering in Description Logics[].Proc of KR.2006
  • 8Stoilos G,Stamou G,TzouvarasV, et al.A Fuzzy Description Logic for Multimedia Knowledge Representation[C/OL]. http://www.image.ece.ntua.gr/php/pub_details.php- code=385 . 2006
  • 9Stoilos G,Stamou G,TzouvarasV, et al.The Fuzzy Descrip- tion Logic f-SHIN[].Proc of the International Workshop on Uncertainty Reasoning for the Semantic Web.2005
  • 10Ma Z M,Wang H L,Yan L, et al.Fuzzy Description Logic Based on Vague Sets[].Journal of Southeastern University (English version).2007

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部