Enabling local computation for partially ordered preferences
Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of valuation functions. Shenoy and Shafer showed how such a computation can be performed using a local computation scheme. A major strength of this work is that it is based on an algebraic description: what is proved is the correctness of the local computation algorithm under a few axioms on the algebraic structure. The instantiations of the framework in practice make use of totally ordered scales. The present paper focuses on the use of partially ordered scales and examines how such scales can be cast in the Shafer-Shenoy framework and thus benefit from local computation algorithms. It also provides several examples of such scales, thus showing that each of the algebraic structures explored here is of interest.
Soft constraints , Dynamic programming , Local computation , Valuation networks/algebra , Constraint satisfaction , Optimization
Fargier, H,Rollon, E,Wilson, N; (2010) 'Enabling local computation for partially ordered preferences'. Constraints, 15 (4) :516-539. doi: 10.1007/s10601-010-9094-z [untranslated]
© Springer Science+Business Media, LLC 2010. The final publication is available at http://link.springer.com/article/10.1007%2Fs10601-010-9094-z