PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Cerami M., Straccia U. Complexity sources in fuzzy description logic. In: DL-2014 - 27th International Workshop on Description Logics (Vienna, Austria, 17-20 July 2014). Proceedings, pp. 421 - 433. Meghyn Bienvenu, Magdalena Ortiz, Riccardo Rosati, Mantas Simkus (eds.). (CEUR Workshops Series, vol. 1193). http://ceur-ws.org, 2014.
 
 
Abstract
(English)
In recent years many Fuzzy Description Logics (FDLs) based on infinite $t$-norms have been proved to be undecidable. On the other hand, several FDLs based on finite $t$-norms, not only have been proved to be decidable, but they have been proved to belong to the same complexity classes as the corresponding crisp DLs. In light of such results, a question that naturally arises is whether the finite-valued fuzzy framework is no more complex than the crisp-valued formalism. The aim of this work is to analyze some of the complexity sources that are not present in the crisp framework. To this end, we will consider FDL languages with low expressivity that allow us to observe how the need for more complex deciding strategies, not required in the crisp framework, arises in many-valued FDLs.
URL: http://ceur-ws.org/Vol-1193/paper_41.pdf
Subject Fuzzy Description Logics
I.2.4 Knowledge Representation Formalisms and Methods


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional