Abstract
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 becomes co-NP-complete.
Cite
CITATION STYLE
Borgwardt, S., Galano, J. A. L., & Peñaloza, R. com. (2014). The fuzzy description logic G-FL0 with greatest fixed-point semantics. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8761, 62–76. https://doi.org/10.1007/978-3-319-11558-0_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
