论文信息 - Conjunctive Query Answering over an f-ALC Knowledge Base

Conjunctive Query Answering over an f-ALC Knowledge Base

In this paper, we present the very first algorithm for answering expressive fuzzy conjunctive queries, which allow the occurrence of both lower bound and the upper bound of threshold in a query atom, over the relative expressive fuzzy DL, f-ALC. The algorithm we suggest here can easily be adapted to existing (and future) DL implementations. We distinguish the queries into two categories, the ground and the variable-involved Boolean queries, and present the algorithms for them sequentially.

Zongmin Ma | Jingwei Cheng | Xing Wang | Fu Zhang

[1] Riccardo Rosati,et al. On Conjunctive Query Answering in EL , 2007, Description Logics.

[2] Umberto Straccia. Answering Vague Queries in Fuzzy DL-Lite , 2006 .

[3] Ian Horrocks,et al. Conjunctive Query Answering for the Description Logic SHIQ , 2007, IJCAI.

[4] Hailong Wang,et al. A vague description logic SI , 2008, 2008 IEEE International Conference on Fuzzy Systems (IEEE World Congress on Computational Intelligence).

[5] Diego Calvanese,et al. Conjunctive query containment and answering under description logic constraints , 2008, TOCL.

[6] Umberto Straccia,et al. Reasoning within Fuzzy Description Logics , 2011, J. Artif. Intell. Res..

[7] Ashok K. Chandra,et al. Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[8] Alon Y. Halevy,et al. Combining Horn Rules and Description Logics in CARIN , 1998, Artif. Intell..

[9] Jeff Z. Pan,et al. Scalable querying services over fuzzy ontologies , 2008, WWW.

[10] Diego Calvanese,et al. Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[11] Diego Calvanese,et al. Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .