"GB - Spojen\u00E9 kr\u00E1lovstv\u00ED Velk\u00E9 Brit\u00E1nie a Severn\u00EDho Irska" . . . "6"^^ . . . . . . . "1"^^ . "Werner, Tom\u00E1\u0161" . . "[C44E1486AEB9]" . . . . "Artificial Intelligence" . . . "RIV/68407700:21230/10:00170731" . "30"^^ . . "Zytnicki, M." . "Soft arc consistency revisited"@en . "Valued constraint satisfaction problem, Weighted constraint satisfaction problem; Soft constraints; Constraint optimization; Local consistency; Soft arc consistency; Graphical model; Submodularity"@en . "Cooper, M. C." . . "Schiex, T." . "The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. The incremental lower bounds produced by local consistency filtering are used for pruning inside Branch and Bound search. We extend the notion of arc consistency by allowing fractional weights and by allowing several arc consistency operations to be applied simultaneously. To reach a more practical algorithm, we show that the existence of a sequence of arc consistency operations which increases the lower bound can be detected by establishing arc consistency in a classical Constraint Satisfaction Problem (CSP) derived from the original cost function network. These algorithms have been implemented and evaluated on a variety of problems, including two difficult frequency assignment problems which are solved to optimality for the first time."@en . . . "174" . "288228" . . "The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. The incremental lower bounds produced by local consistency filtering are used for pruning inside Branch and Bound search. We extend the notion of arc consistency by allowing fractional weights and by allowing several arc consistency operations to be applied simultaneously. To reach a more practical algorithm, we show that the existence of a sequence of arc consistency operations which increases the lower bound can be detected by establishing arc consistency in a classical Constraint Satisfaction Problem (CSP) derived from the original cost function network. These algorithms have been implemented and evaluated on a variety of problems, including two difficult frequency assignment problems which are solved to optimality for the first time." . "Soft arc consistency revisited" . "RIV/68407700:21230/10:00170731!RIV11-MSM-21230___" . "Soft arc consistency revisited"@en . "Sanchez, M." . "0004-3702" . "000277328200001" . "7-8" . . "de Givry, S." . "P(7E08031), R" . "Soft arc consistency revisited" . "21230" . .