.png){kind=icon}
.png){kind=icon}
Return
Bi-oriented graphs and four valued logic for preference modelling
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-023-05371-w.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we show the relations between 4-valued logics (and more precisely the DDT logic) and the use of bi-oriented graphs. Further on we focus on the use of bi-oriented graphs for non conventional preference modelling. More specifically, we show how bi-oriented graphs can be used in order to represent extended preference structures of the type definable using the DDT logic which has been created with the purpose of modelling hesitation in preference statements. We then study how transitive closure can be extended within such extended preference structures.
Keywords:
DDT logic
Bi-oriented graphs
Signed graphs
Transitive closure
Preference modelling