Reasoning with various kinds of preferences: logic, non-monotonicity, and algorithms

As systems dealing with preferences become more sophisticated, it becomes essential to deal with various kinds of preference statements and their interaction. We introduce a non-monotonic logic distinguishing sixteen kinds of preferences, ranging from strict to loose and from careful to opportunistic, and two kinds of ways to deal with uncertainty, either optimistically or pessimistically. The classification of the various kinds of preferences is inspired by a hypothetical agent comparing the two alternatives of a preference statement. The optimistic and pessimistic way of dealing with uncertainty correspond on the one hand to considering either the best or the worst states in the comparison of the two alternatives of a preference statement, and on the other hand to the calculation of least or most specific “distinguished” preference orders from a set of preference statements. We show that each way to calculate distinguished preference orders is compatible with eight kinds of preferences, in the sense that it calculates a unique distinguished preference order for a set of such preference statements, and we provide efficient algorithms that calculate these unique distinguished preference orders. In general, optimistic kinds of preferences are compatible with optimism in calculating distinguished preference orders, and pessimistic kinds of preferences are compatible with pessimism in calculating distinguished preference orders. However, these two sets of eight kinds of preferences are not exclusive, such that some kinds of preferences can be used in both ways to calculate distinguished preference orders, and other kinds of preferences cannot be used in either of them. We also consider the merging of optimistically and pessimistically constructed distinguished preferences orders. Copyright Springer Science+Business Media, LLC 2008