| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 396906 | International Journal of Approximate Reasoning | 2015 | 12 Pages |
Abstract
•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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Radim Belohlavek, Michal Krupka,