Specific preference statements may reverse general preference statements, thus constituting a change of attitude in particular situations. We define a semantics of preference reversal by relaxing the popular ceteris-paribus principle. We characterize preference reversal as default reasoning and we link it to prioritized Pareto-optimization, which permits a natural computation of preferred solut...

The paper deals in a preliminary way with the problem of the selection of a unique fuzzy preference relation from the set of fuzzy preference relations. A direct algorithm of possibilistic clustering is the basis of the method of fuzzy preference relation discriminating. A method of decision-making based on a fuzzy preference relation is described and basic concepts of the heuristic method of p...

In this paper, we consider the issue of how first-order answer set programs can be extended for handling preference reasoning. To this end, we propose a progression-based preference semantics for first-order answer set programs while explicit preference relations are presented. We study essential properties of the proposed preferred answer set semantics. To understand the expressiveness of pref...

Complete pre-orders can be characterized in terms of the transitivity of the corresponding strict preference and indifference relations. In this paper, we investigate this characterization in a fuzzy setting. We consider two types of completeness (weak completeness and strong completeness) and decompose a fuzzy pre-order by means of an indifference generator, in particular a Frank t-norm. In th...

A fuzzy multipurpose decision making problem, where the information about the alternatives provided by the experts can be presented by means of diierent preference representation structures, is studied. Assuming that the information can be represented by means of preference orderings, utility functions and fuzzy preference relations, a general multipurpose decision making model is managed to co...

This paper shows how revealed preference relations, observed under general budget sets, can be extended using closure operators which impose certain assumptions on preferences. Common extensions are based on the assumption that preferences are convex and/or monotonic, but we also consider satiated single-peaked preferences. For the obtained extended relations, the paper provides necessary and s...

In abductive reasoning, preference criteria for selecting the best explanation are regarded as qualitative properties (like being simpler or more plausible) which are beyond the pure causal or deductive relationship between an explanandum and its explanations. This paper is a contribution to the clarification of the relationship between preference criteria and structural properties of explanato...

A NaP-preference (necessary and possible preference) on a set A is a pair ( , P ) of binary relations on A such that its necessary component N is a partial preorder, its possible component P is a completion of , and the two components jointly satisfy natural forms of mixed completeness and mixed transitivity. We study additional mixed transitivity properties of a NaP-preference ( , P ) , which ...

In Group Decision Making, the expression of consistent preferences is often a very difficult task for the experts, specially in decision problems with a high number of alternatives. This difficulty increases when experts are asked to provide their preferences in the form of preference relations because the amount of preference values that are required increases exponentially. This usually leads...