In this paper we generalize to soft constraints the approximation techniques usually used for local consistency in classical constraint satisfaction and programming. The theoretical results show that this is indeed possible without loosing the fundamental properties of such techniques, and the experimental results ton partial are-consistency) show that this work can help develop more efficient implementations for logic-based languages working with soft constraints.
Labeling and Partial Local Consistency for Soft Constraint Programming
BISTARELLI, Stefano;
2000
Abstract
In this paper we generalize to soft constraints the approximation techniques usually used for local consistency in classical constraint satisfaction and programming. The theoretical results show that this is indeed possible without loosing the fundamental properties of such techniques, and the experimental results ton partial are-consistency) show that this work can help develop more efficient implementations for logic-based languages working with soft constraints.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
