Conjunctive Query Answering over an f-ALC Knowledge Base

Authors:
Jingwei Cheng;Z. M. Ma;Fu Zhang;Xing Wang
Affiliations:
-;-;-;-
Venue:
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Year:
2008

Citing 8
Cited 1

On the decidability of query containment under constraints

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Combining Horn rules and description logics in CARIN

Artificial Intelligence
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
Conjunctive query containment and answering under description logic constraints

ACM Transactions on Computational Logic (TOCL)
Scalable querying services over fuzzy ontologies

Proceedings of the 17th international conference on World Wide Web
Reasoning within fuzzy description logics

Journal of Artificial Intelligence Research
Conjunctive query answering for the description logic SHIQ

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Deciding Query Entailment for Fuzzy $\mathcal{SHIN}$ Ontologies

ASWC '09 Proceedings of the 4th Asian Conference on The Semantic Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.