We introduce a new multiple criteria ranking/choice method that applies Dominance-based Rough Set Approach (DRSA) and represents the Decision Maker’s (DM’s) preferences with decision rules. The DM provides a set of pairwise comparisons indicating whether an outranking (weak preference) relation should hold for some pairs of reference alternatives. This preference information is structured using...

In Japanese dependency parsing, Kudo’s relative preference-based method (Kudo and Matsumoto, 2005) outperforms both deterministic and probabilistic CKY-based parsing methods. In Kudo’s method, for each dependent word (or chunk) a loglinear model estimates relative preference of all other candidate words (or chunks) for being as its head. This cannot be considered in the deterministic parsing me...

Situations akin to public deliberation leading to preference changes are modelled. A set of agents is considered, each endowed with a preference relation over a set of objects and a reliability relation over the involved agents. Different ways in which the public announcement of the current individual preferences can influence the agents’ future preferences are studied. Special emphasis is give...

Comparative preference statements are the basic ingredients of conditional logics for representing users’ preferences in a compact way. These statements may be strict or not and obey different semantics. Algorithms have been developed in the literature to compute a preference relation over outcomes given a set of comparative preference statements and one or several semantics. These algorithms a...

Some famous problems (ATMS inference, Closed World Reasoning (CWR) for instance) can be replaced by a problem of preferred model computation. We thus propose a preference relation between models based on a preference relation between literals and an \eecient" algorithm to compute the associated preferred models of a theory. Then, we apply this algorithm to ATMS inference and problems of CWR. Su...

We define preference in terms of a constraint sequence, a concept from optimality theory. In case agents only have incomplete information, beliefs are introduced. We propose three definitions to describe different procedures agents may follow to get a preference relation using the incomplete information. Changes of preference are explored w.r.t their sources: changes of the constraint sequence,...

We generalize the solution of a multicriterial optimization problem which has been given in [5]. They have used a comparison of the criterion fuzzy preference relations and the general fuzzy preference relation. Based on this comparison they have constructed the ordering of criteria. Our modification builds on pairwise similarity of criterion related fuzzy preference relations. We illustrate ou...

Given a finite set of generalized lotteries, that is random quantities equipped with a belief function, and a partial preference relation on them, a necessary and sufficient condition (Choquet rationality) has been provided for its representation as a Choquet expected utility of a strictly increasing utility function. Here we prove that this condition assures the extension of the preference rel...

This note explores the connections between continuity and completeness under alternative conceptions of preference relations. For non-trivial preorders, it shows that, unlike the standard definitions, the weak preference relation defined in Galaabataar and Karni (2010) allows for incomplete preferences while maintaining all the continuity properties of complete preference relations. It also mak...

Qualitative choice logic (QCL) is a propositional logic for representing prioritized alternatives. The logic adds to classical propositional logic a new connective called ordered disjunction: A~×B intuitively means: if possible A, but if A is not possible then at least B. QCL inference is obtained by defining a preference relation between interpretations of a propositional language. This paper ...