We present and discuss some novel and somewhat surprising complexity results for a basic but significant fuzzy description logic (DL) which extends the classical language. In particular we show that checking the consistency of a concept or a KB in fuzzy DLs has a complexity which jumps from linear-time to EXPTIME-complete, while the subsumption problem is always (at least) as hard as in crisp DLs
Fuzzy description logics can be used to model vague knowledge in application domains. This paper ana...
In the last few years there has been a large effort for analysing the com-putational properties of r...
Description Logics (DLs, for short) allow reasoning about individuals and concepts, i.e. set of indi...
Abstract. In recent years many Fuzzy Description Logics (FDLs) based on infinite t-norms have been p...
Fuzzy Description Logics (DLs) can be used to represent and reason with vague knowledge. This family...
The complexity of reasoning in fuzzy description logics (DLs) over fi-nite lattices usually does not...
the date of receipt and acceptance should be inserted later Abstract We study the complexity of reas...
In the last few years there has been a large effort for analysing the computational properties of re...
The complexity of reasoning in fuzzy description logics (DLs) over finite lattices usually does not ...
Abstract. In the last few years, the complexity of reasoning in fuzzy description logics has been st...
Abstract. In the last few years, the complexity of reasoning in fuzzy description logics has been st...
Abstract. The complexity of reasoning in fuzzy description logics (DLs) over a finite lattice L usua...
Fuzzy Description Logics have been widely studied as a formalism for representing and reasoning with...
Description logics (DLs) are used to represent knowledge of an application domain and provide standa...
Fuzzy description logics (DLs) have been investigated for over two decades, due to their capacity to...
Fuzzy description logics can be used to model vague knowledge in application domains. This paper ana...
In the last few years there has been a large effort for analysing the com-putational properties of r...
Description Logics (DLs, for short) allow reasoning about individuals and concepts, i.e. set of indi...
Abstract. In recent years many Fuzzy Description Logics (FDLs) based on infinite t-norms have been p...
Fuzzy Description Logics (DLs) can be used to represent and reason with vague knowledge. This family...
The complexity of reasoning in fuzzy description logics (DLs) over fi-nite lattices usually does not...
the date of receipt and acceptance should be inserted later Abstract We study the complexity of reas...
In the last few years there has been a large effort for analysing the computational properties of re...
The complexity of reasoning in fuzzy description logics (DLs) over finite lattices usually does not ...
Abstract. In the last few years, the complexity of reasoning in fuzzy description logics has been st...
Abstract. In the last few years, the complexity of reasoning in fuzzy description logics has been st...
Abstract. The complexity of reasoning in fuzzy description logics (DLs) over a finite lattice L usua...
Fuzzy Description Logics have been widely studied as a formalism for representing and reasoning with...
Description logics (DLs) are used to represent knowledge of an application domain and provide standa...
Fuzzy description logics (DLs) have been investigated for over two decades, due to their capacity to...
Fuzzy description logics can be used to model vague knowledge in application domains. This paper ana...
In the last few years there has been a large effort for analysing the com-putational properties of r...
Description Logics (DLs, for short) allow reasoning about individuals and concepts, i.e. set of indi...
DOI
Add to ORKG