Skip to main content
Conference ProceedingsOPEN ACCESS

Fuzzy ordering relation and fuzzy poset

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4815 LNCS 209-216
DOI: 10.1007/978-3-540-77046-6_26
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Connections between (weakly) reflexive, antisymmetric and transitive lattice-valued fuzzy relations on a nonempty set X (fuzzy ordering relations on X) and fuzzy subsets of a crisp poset on X (fuzzy posets) are established and various properties of cuts of such structures are proved. A representation of fuzzy sets by cuts corresponding to atoms in atomically generated lattices has also been given. © Springer-Verlag Berlin Heidelberg 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Šešelja, B., & Tepavčevic̀, A. (2007). Fuzzy ordering relation and fuzzy poset. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4815 LNCS, pp. 209–216). Springer Verlag. https://doi.org/10.1007/978-3-540-77046-6_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free