Some complexity results on fuzzy description logics

Authors:
Piero A. Bonatti;Andrea G. B. Tettamanzi
Affiliations:
Dipartimento di Scienze Fisiche — Sezione di Informatica, Complesso Universitario di Monte Sant'Angelo, Università di Napoli “Federico II”, Napoli, Italy;Dipartimento di Tecnologie dell'Informazione, Università degli Studi di Milano, Crema (CR), Italy
Venue:
WILF'03 Proceedings of the 5th international conference on Fuzzy Logic and Applications
Year:
2003

Citing 3
Cited 4

On triangular norm-based propositional fuzzy logics

Fuzzy Sets and Systems - Special issue on fuzzy information processing
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Reasoning within fuzzy description logics

Journal of Artificial Intelligence Research

Evolutionary algorithms for reasoning in fuzzy description logics with fuzzy quantifiers

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs

Reasoning Web
Reasoning with very expressive fuzzy description logics

Journal of Artificial Intelligence Research
A Fuzzy Ontology for Database Querying with Bipolar Preferences

International Journal of Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present and discuss some novel and somewhat surprising complexity results for a basic but significant fuzzy description logic (DL) which extends the classical $\mathcal{ALC}$ 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.