The present paper gives a state-of-the-art overview of general representation results for fuzzy weak orders. We do not assume that the underlying domain of alternatives is finite. Instead, we concentrate on results that hold in the most general case that the underlying domain is possibly infinite. This paper presents three fundamental representation results: (i) score function-based representations, (ii) inclusion-based representations, (iii) representations by decomposition into crisp linear orders and fuzzy equivalence relations. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Bodenhofer, U., De Baets, B., & Fodor, J. (2006). General representation theorems for fuzzy weak orders. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4342 LNAI, pp. 229–244). https://doi.org/10.1007/11964810_11
Mendeley helps you to discover research relevant for your work.