Some Complexity Results on Fuzzy Description Logics

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article 01 Jan 2006 Italy Publisher:Springer Berlin Heidelberg

Authors: BONATTI, PIERO ANDREA; A. Tettamanzi;

doi: 10.1007/10983652_3

handle: 11588/458956 , 2434/24322

Some Complexity Results on Fuzzy Description Logics

- Summary
- Metrics

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.

Country

Italy

Related Organizations

University Federico II of Naples
Italy
University of Milan
Italy

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	9
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%