On the Undecidability of Fuzzy Description Logics with GCIs and Product T-norm

Abstract

The combination of Fuzzy Logics and Description Logics (DLs) has been investigated for at least two decades because such fuzzy DLs can be used to formalize imprecise concepts. In particular, tableau algorithms for crisp Description Logics have been extended to reason also with their fuzzy counterparts. Recently, it has been shown that, in the presence of general concept inclusion axioms (GCIs), some of these fuzzy DLs actually do not have the finite model property, thus throwing doubt on the correctness of tableau algorithm for which it was claimed that they can handle fuzzy DLs with GCIs. In a previous paper, we have shown that these doubts are indeed justified, by proving that a certain fuzzy DL with product t-norm and involutive negation is undecidable. In the present paper, we show that undecidability also holds if we consider a t-norm-based fuzzy DL where disjunction and involutive negation are replaced by the constructor implication, which is interpreted as the residuum. The only condition on the t-norm is that it is a continuous t-norm “starting” with the product t-norm, which covers an uncountable family of t-norms.

DOI: 10.1007/978-3-642-24364-6_5

Extracted Key Phrases

010202011201220132014201520162017
Citations per Year

65 Citations

Semantic Scholar estimates that this publication has 65 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Baader2011OnTU, title={On the Undecidability of Fuzzy Description Logics with GCIs and Product T-norm}, author={Franz Baader and Rafael Pe{\~n}aloza}, booktitle={FroCoS}, year={2011} }