Abstract

语义Web模糊知识的表示和应用常常涉及模糊隶属度比较,但现有描述逻辑的模糊扩展缺乏描述模糊隶属度比较的能力.提出支持模糊隶属度比较和描述逻辑ALCN(attributive concept description language with complements and number restriction)概念构造子的扩展模糊描述逻辑FCALCN(fuzzy comparable ALCN).FCALCN引入新的原子概念形式以支持模糊隶属度比较.给出FCALCN的推理算法,证明了在空TBox约束下FCALCN的推理问题复杂性是多项式空间完全的.FCALCN能够表达语义Web上涉及模糊隶属度比较的复杂模糊知识并实现对它们的推理.;The representation and application of fuzzy knowledge on the semantic Web often relate to the comparisons between fuzzy membership degrees. However, the current fuzzy extensions of description logics do not support the expression of such comparisons. This paper proposes an extended fuzzy description logic that supports the comparisons of fuzzy membership degrees and the concept constructors from description logic ALCN (attributive concept description language with complements and number restriction), written FCALCN (fuzzy comparable ALCN). FCALCN introduces new forms of atom concepts in order to support the comparisons between fuzzy membership degrees. A reasoning algorithm for FCALCN is proposed, and the complexity of the reasoning problems of FCALCN with empty TBox is proved to be PSpace-complete. FCALCN can represent expressive fuzzy knowledge involving the comparisons of fuzzy membership degrees on the semantic Web and enable reasoning of them.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.