کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
396906 1438438 2015 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Central points and approximation in residuated lattices
ترجمه فارسی عنوان
نقاط مرکزی و تقریبی در شبکه های محصور شده
کلمات کلیدی
شبکه خالی، نقطه مرکزی، تحمل
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی


• We present results on approximation in residuated lattices given that closeness is assessed by means of biresiduum.
• We define basic notions as central points of subsets of residuated lattices and closed balls.
• We describe central points, optimal central points, and unique central points and examine several of their properties.
• We present algorithms for two problems regarding optimal approximation.

The paper presents results on approximation in residuated lattices given that closeness is assessed by means of biresiduum. We describe central points and optimal central points of subsets of residuated lattices and examine several of their properties. In addition, we present algorithms for two problems regarding optimal approximation.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Approximate Reasoning - Volume 66, November 2015, Pages 27–38
نویسندگان
, ,