Positive subsumption in fuzzy EL with general t-norms

Authors:
Stefan Borgwardt;Rafael Peñaloza
Affiliations:
TU Dresden, Germany;Center for Advancing Electronics Dresden, TU Dresden, Germany
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 9
Cited 0

The Description Logic Handbook

The Description Logic Handbook
Reasoning within fuzzy description logics

Journal of Artificial Intelligence Research
Terminological cycles in a description logic with existential restrictions

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Pushing the EL envelope

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Computational complexity of t-norm based propositional fuzzy logics with rational truth constants

Fuzzy Sets and Systems
Making fuzzy description logic more general

Fuzzy Sets and Systems
How fuzzy is my fuzzy description logic?

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Tractable reasoning with vague knowledge using fuzzy $\mathcal{EL}^{++}$

Journal of Intelligent Information Systems
On the (un)decidability of fuzzy description logics under Łukasiewicz t-norm

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Description Logic EL is used to formulate several large biomedical ontologies. Fuzzy extensions of EL can express the vagueness inherent in many biomedical concepts. We study the reasoning problem of deciding positive subsumption in fuzzy EL with semantics based on general t-norms. We show that the complexity of this problem depends on the specific t-norm chosen. More precisely, if the t-norm has zero divisors, then the problem is co-NP-hard; otherwise, it can be decided in polynomial time. We also show that the best subsumption degree cannot be computed in polynomial time if the t-norm contains the Lukasiewicz t-norm.