Soft constraint formalisms are an abstract representation of Constraint Satisfaction Problems (CSPs): the set of preferences is now parametric, often forming (a variety of) an absorptive semiring. However, the latter is suitable only for negative preferences, i.e., such that the combination of constraints worsens the quality of the solution. This work comments on related work and exploits residuated semirings in order to lift the Local Consistency heuristics that hold for classical CSPs. As a result, we merge and generalise existent formalisms for modelling soft CSPs with bipolar (positive and negative) preferences.
Residuation for bipolar preferences in soft constraints
GADDUCCI, FABIO;
2017-01-01
Abstract
Soft constraint formalisms are an abstract representation of Constraint Satisfaction Problems (CSPs): the set of preferences is now parametric, often forming (a variety of) an absorptive semiring. However, the latter is suitable only for negative preferences, i.e., such that the combination of constraints worsens the quality of the solution. This work comments on related work and exploits residuated semirings in order to lift the Local Consistency heuristics that hold for classical CSPs. As a result, we merge and generalise existent formalisms for modelling soft CSPs with bipolar (positive and negative) preferences.| File | Dimensione | Formato | |
|---|---|---|---|
|
ipl118.pdf
solo utenti autorizzati
Tipologia:
Versione finale editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
327.79 kB
Formato
Adobe PDF
|
327.79 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
Revised Manuscript.pdf
accesso aperto
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
134.78 kB
Formato
Adobe PDF
|
134.78 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
