The Fuzzy Description Logic G-FL0 with Greatest Fixed-Point Semantics
Leyva, Galano JA
MetadataShow full item record
We study the fuzzy extension of the Description Logic FL0 with semantics based on the Gödel t-norm. We show that subsumption w.r.t. a finite set of primitive definitions, using greatest fixed-point semantics, can be characterized by a relation on weighted automata. We use this result to provide tight complexity bounds for reasoning in this logic, showing that it is PSpace-complete. If the definitions do not contain cycles, subsumption becomesco-NP-complete.