The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
A PSpace algorithm for deciding ALCNIR satisfiability
A PSpace algorithm for deciding ALCNIR satisfiability
Managing uncertainty and vagueness in description logics for the Semantic Web
Web Semantics: Science, Services and Agents on the World Wide Web
Fuzzy description logics under Gödel semantics
International Journal of Approximate Reasoning
General Concept Inclusions in Fuzzy Description Logics
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Reasoning within fuzzy description logics
Journal of Artificial Intelligence Research
Keys, nominals, and concrete domains
Journal of Artificial Intelligence Research
Fuzzy description logics with general t-norms and datatypes
Fuzzy Sets and Systems
Making fuzzy description logic more general
Fuzzy Sets and Systems
Fuzzy Description Logics and t-norm based fuzzy logics
International Journal of Approximate Reasoning
On the failure of the finite model property in some Fuzzy Description Logics
Fuzzy Sets and Systems
On the undecidability of fuzzy description logics with GCIs and product t-norm
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
A tableau algorithm for fuzzy description logics over residuated de morgan lattices
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Positive subsumption in fuzzy EL with general t-norms
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Fuzzy Description Logics (DLs) with t-norm semantics have been studied as a means for representing and reasoning with vague knowledge. Recent work has shown that even fairly inexpressive fuzzy DLs become undecidable for a wide variety of t-norms. We complement those results by providing a class of t-norms and an expressive fuzzy DL for which ontology consistency is linearly reducible to crisp reasoning, and thus has its same complexity. Surprisingly, in these same logics crisp models are insufficient for deciding fuzzy subsumption.