Abstract
Closure operators (and related structures) are investigated from the point of view of fuzzy set theory. The paper is a follow up to [7] where fundamental notions and result have been established. The present approach generalizes the existing approaches in two ways: first, complete residuated lattices are used as the structures of truth values (leaving the unite interval [0,1] with minimum and other t-norms particular cases); second, the monotony condition is formulated so that it can reflect also partial subsethood (not only full subsethood as in other approaches). In this paper, we study relations induced by fuzzy closure operators (fuzzy quasiorders and similarities); factorization of closure systems by similarities and by so-called decrease of logical precision; representation of fuzzy closure operators by (crisp) closure operators; relation to consequence relations; and natural examples illustrating the notions and results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Supported by grant no. 201/99/P060 of the GA ČR and by NATO Advanced Fellowship B for 2000. The author would like to thank to Professor G. Gerla for helpful comments. Part of the paper written during author's research visit at the Center for Intelligent Systems, State University of New York at Binghamton. Support by the Center and by its director, Professor G.J. Klir, is gratefully acknowledged.
Rights and permissions
About this article
Cite this article
Bělohlávek, R. Fuzzy closure operators II: induced relations, representation, and examples. Soft Computing 7, 53–64 (2002). https://doi.org/10.1007/s00500-002-0165-y
Issue Date:
DOI: https://doi.org/10.1007/s00500-002-0165-y