Attributive concept descriptions with complements
Artificial Intelligence
P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
A Family of Extended Fuzzy Description Logics
COMPSAC '05 Proceedings of the 29th Annual International Computer Software and Applications Conference - Volume 01
Reasoning within fuzzy description logics
Journal of Artificial Intelligence Research
Generalizing term subsumption languages to fuzzy logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A Crisp Representation for Fuzzy $\cal SHOIN$ with Fuzzy Nominals and General Concept Inclusions
Uncertainty Reasoning for the Semantic Web I
Fuzzy description logics under Gödel semantics
International Journal of Approximate Reasoning
Reasoning with very expressive fuzzy description logics
Journal of Artificial Intelligence Research
Representing and reasoning on fuzzy UML models: A description logic approach
Expert Systems with Applications: An International Journal
Reasoning with the finitely many-valued Łukasiewicz fuzzy Description Logic SROIQ
Information Sciences: an International Journal
Hi-index | 0.00 |
Classical description logics are limited to dealing with crisp concepts and crisp roles. However, Web applications based on description logics should allow the treatment of the inherent imprecision. Therefore, it is necessary to add fuzzy features to description logics. A family of extended fuzzy description logics, which is a fuzzy extension of description logics by introducing cut set to describe fuzzy feature, is proposed to enable representation and reasoning for complex fuzzy information. This paper discusses the reasoning technique for reasoning tasks of a given extended fuzzy description logic extended fuzzy $\cal {ALCQ}$ by adopting classical description logic $\cal{ALCQ}$ to discretely simulate extended fuzzy $\cal{ALCQ}$ in polynomial time and reusing the existing result to prove the complexity of extended fuzzy $\cal{ALCQ}$ reasoning tasks.