Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/24
Title: | Poset valued intuitionistic preference relations | Authors: | Djukić M. Tepavčević, Andreja |
Issue Date: | 1-Jan-2020 | Journal: | Studies in Computational Intelligence | Abstract: | © Springer Nature Switzerland AG 2020. It is known that in every finite poset each element can be presented as a join of completely join-irreducible elements. This representation is used here to justify a new notion of poset-valued reciprocal (preference) relations and also the intuitionistic version of this definition. Join-irreducible elements would represent pieces of information representing grade of preference in this framework. It is demonstrated that no restriction on type of a poset is needed for developing the intuitionistic approach, except that the poset should be bounded with the top element T and the bottom element B (T representing the total preference). Some properties are proved and connections with previous definitions are shown. It is demonstrated that the new definition is in a sense more general (and in some aspects more convenient) than previous ones. | URI: | https://open.uns.ac.rs/handle/123456789/24 | ISSN: | 1860949X | DOI: | 10.1007/978-3-030-16024-1_9 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.