Reasoning within the Extended Fuzzy Description Logics with Restricted Terminological Boxes

Abstract

The extended fuzzy description logics extend the classical description logics by introducing cut concepts and cut roles to support expressive representation and reasoning for fuzzy knowledge. But the current extended fuzzy description logics lack reasoning algorithms with TBoxes. The paper proposes the sat-domain problem of the extended fuzzy description logic EFALCR+ with restricted TBoxes, and gives an optimized reasoning algorithm, which is proved to be sound, complete and with a worst complexity of EXPTime; then proves the complexity of the problem is EXPTime- complete.