Fuzzy description logics (DLs) have been investigated for over two decades, due to their capacity to formalize and reason with imprecise concepts. Very recently, it has been shown that for several fuzzy DLs, reasoning becomes undecidable. Although the proofs of these results differ in the details of each specific logic considered, they are all based on the same basic idea. In this report, we formalize this idea and provide sufficient conditions for proving undecidability of a fuzzy DL. We demonstrate the effectiveness of our approach by strengthening all previously-known undecidability results and providing new ones. In particular, we show that undecidability may arise even if only crisp axioms are considered
In the last few years there has been a large effort for analysing the computational properties of re...
Fuzzy Description Logics (DLs) are logics that allow to deal with vague structured knowledge. Althou...
We present and discuss some novel and somewhat surprising complexity results for a basic but signifi...
Fuzzy description logics (DLs) have been investigated for over two decades, due to their capacity to...
Fuzzy Description Logics (DLs) can be used to represent and reason with vague knowledge. This family...
Description logics (DLs) are used to represent knowledge of an application domain and provide standa...
Abstract. The combination of Fuzzy Logics and Description Logics (DLs) has been investigated for at ...
Abstract. Recent results show that ontology consistency is undecid-able for a wide variety of fuzzy ...
Abstract. Fuzzy Description Logics (FDLs) combine classical Descrip-tion Logics with the semantics o...
Fuzzy Description Logics (FDLs) combine classical Description Logics with the semantics of Fuzzy Log...
Abstract. In recent years many Fuzzy Description Logics (FDLs) based on infinite t-norms have been p...
Description Logics (DLs, for short) allow reasoning about individuals and concepts, i.e. set of indi...
Abstract. Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structur...
Description Logics (DLs) are knowledge representation languages built on the basis of classical logi...
Abstract. An important line of research within the field of fuzzy DLs is the computation of an equiv...
In the last few years there has been a large effort for analysing the computational properties of re...
Fuzzy Description Logics (DLs) are logics that allow to deal with vague structured knowledge. Althou...
We present and discuss some novel and somewhat surprising complexity results for a basic but signifi...
Fuzzy description logics (DLs) have been investigated for over two decades, due to their capacity to...
Fuzzy Description Logics (DLs) can be used to represent and reason with vague knowledge. This family...
Description logics (DLs) are used to represent knowledge of an application domain and provide standa...
Abstract. The combination of Fuzzy Logics and Description Logics (DLs) has been investigated for at ...
Abstract. Recent results show that ontology consistency is undecid-able for a wide variety of fuzzy ...
Abstract. Fuzzy Description Logics (FDLs) combine classical Descrip-tion Logics with the semantics o...
Fuzzy Description Logics (FDLs) combine classical Description Logics with the semantics of Fuzzy Log...
Abstract. In recent years many Fuzzy Description Logics (FDLs) based on infinite t-norms have been p...
Description Logics (DLs, for short) allow reasoning about individuals and concepts, i.e. set of indi...
Abstract. Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structur...
Description Logics (DLs) are knowledge representation languages built on the basis of classical logi...
Abstract. An important line of research within the field of fuzzy DLs is the computation of an equiv...
In the last few years there has been a large effort for analysing the computational properties of re...
Fuzzy Description Logics (DLs) are logics that allow to deal with vague structured knowledge. Althou...
We present and discuss some novel and somewhat surprising complexity results for a basic but signifi...