A logic of conditional preferences is defined, with a language which allows a compact representation of certain kinds of conditional preference statements, a semantics and a proof theory, and an approach to constrained optimisation can be used which generalises a natural approach for CP-nets.Expand

We propose and investigate a number of techniques for solving such problems based on combinations of Monte Carlo simulation, solutions to the associated deterministic problem, and either constraint programming or tabu search.Expand

The method of reasoning with uncertain information known as Dempster-Shafer theory arose from the reinterpretation and development of work of Arthur DemPster [Dempster, 1967; 1968] by Glenn Shafer in his book a mathematical theory of evidence [Shafer, 1976], and further publications e.g., [Smets, 1988; Smets and Keimes, 1994] and the Theory of Hints.Expand

A simple logic of conditional preferences is defined, with a language that allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory generalise those of CP-nets and TCP-nets.Expand

We study how valuation algebras are induced by semirings and how the structure of valuation algebra is related to the algebraic structure of the semiring.Expand

We propose a "prototypical" preference logic, which combines features of existing preference logics, and then we show that many well-known preference languages, such as CP-nets and its extensions, are natural fragments of it.Expand

The paper derives various sufficient conditions for a subset of the logical language to be consistent, and develops methods for finding a total order on outcomes which is consistent with the set of conditional preferences.Expand

We define several notions of optimal solutions for soft constraint problems, providing algorithms to find optimal solutions and also to test whether a solution is optimal.Expand