توضیحات
ABSTRACT
In the current paper we study the reasoning problem for fuzzy SI (f-SI) under arbitrary continuous fuzzy operators. Our work can be seen as an extension of previous works that studied reasoning algorithms for f-SI, but focused on specific fuzzy operators, e.g. fKD-SI and of reasoning algorithms for less expressive fuzzy DLs, like fL-ALC
and fP -ALC (fuzzy ALC under the Lukasiewicz and product fuzzy operators, respectively). We show how transitivity can be handled for all the range of continuous fuzzy DLs and discuss about blocking and correctness in this setting. Based on these analysis, we present a unifying framework for reasoning over the class of continuous fuzzy DLs. Finally use the results to prove decidability of several fuzzy SI DLs.
INTRODUCTION
Although, DLs are considerably expressive they have limitations especially when it comes to modelling domains where imprecise or vague information is present, thus fuzzy extensions to DLs have been proposed [13, 12, 8, 2]. Fuzzy DLs are envisioned to be useful for several applications that face such knowledge and today there is a great deal of effort to apply them in several domains like multimedia analysis and interpretation [11], multimedia retrieval [7], and semantic interoperability (ontology alignment) [3]. For example, in multimedia analysis in order to use semantically rich technologies one has to map from the semanticless numerical values that are extracted by analysis algorithms (e.g. the color, the texture, the shape or other low-level related features) to more high level(fuzzy/vague) concepts like blue, red, smooth, rough, long, small, overlapping, etc. More precisely, we could say that region reg1 is blue to a degree 0.8 and smoothly textured to a degree 0.7 [11]. Then we can use DL axioms deducing high level assertions about the various image regions. Up to now many reasoning algorithms for fuzzy DLs have been presented. Straccia [13] presented a tableaux reasoning algorithm for fKD-ALC (fuzzy ALC under the Zadeh fuzzy operators: x ∧ y à min(x, y), x ∨ y à max(x, y),¬x à 1 − x and x → y à max(1 − x, y)).
Year:2010
Publisher: Department of Electrical and Computer Engineering,
National Technical University of Athens, Zographou 15780, Greece
By: Giorgos Stoilos , Giorgos Stamou
File information: English Language / 12 page / size :141 KB
Download :click
سال:2010
ناشر: ,Department of Electrical and Computer Engineering
National Technical University of Athens, Zographou 15780, Greece
کاری از: Giorgos Stoilos , Giorgos Stamou
اطلاعات فایل: زبان انگلیسی/12 صفحه/ حجم : 141 کیلوبایت
لینک دانلود:روی همین لینک کلیک کنید
نقد و بررسیها
هیچ دیدگاهی برای این محصول نوشته نشده است.