Soft constraint abstraction based on semiring homomorphism

Elsevier B.V.
Publication Type:
Journal Article
Theoretical Computer Science, 2008, 403 (2-3), pp. 192 - 201
Issue Date:
Full metadata record
Files in This Item:
Filename Description SizeFormat
2007004954OK.pdf476.31 kBAdobe PDF
The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi [S. Bistarelli, U. Montanari, F. Rossi, Semiring-based constraints solving and optimization, Journal of the ACM 44 (2) (1997) 201236], is a very general framework of soft constraints. In this paper we propose an abstraction scheme for soft constraints that uses semiring homomorphism. To find optimal solutions of the concrete problem, we first work in the abstract problem and find its optimal solutions, and then use them to solve the concrete problem. In particular, we show that a mapping preserves optimal solutions if and only if it is an order-reflecting semiring homomorphism. Moreover, for a semiring homomorphism ? and a problem P over S, if t is optimal in ?(P), then there is an optimal solution View the MathML source of P such that View the MathML source has the same value as t in ?(P).
Please use this identifier to cite or link to this item: