Reasoning within Fuzzy OWL 2 EL revisited

Description Logics (DLs) are logics with interesting representational and computational features and are at the core of the Web Ontology Language OWL 2 and its profiles among which there is OWL 2 EL. The main feature of OWL 2 EL is that instance/subsumption checking can be decided in polynomial time. On the other hand, fuzzy DLs have been proposed as an extension to classical DLs with the aim of dealing with fuzzy concepts and we focus here on Fuzzy OWL 2 EL under standard and Gödel semantics. We provide some reasoning algorithms showing that instance/subsumption checking decision problems remain polynomial time for Fuzzy OWL 2 EL. We also identify some issues in previous related work (essentially incompleteness problems).