General representation theorems for fuzzy weak orders

Ulrich Bodenhofer, Bernard De Baets, Janos Fodor

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationTheory and Applications of Relational Structures as Knowledge Instruments II - International Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers
Pages229-244
Number of pages16
DOIs
Publication statusPublished - 2006
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4342 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'General representation theorems for fuzzy weak orders'. Together they form a unique fingerprint.

Cite this