Constraint Propagation for Soft Constraint Satisfaction Problems: Generalization and Termination Conditions. Bistarelli, S., Gennari, R., & Rossi, F. 2000. doi abstract bibtex Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables’ values in each soft constraint are uniquely associated to elements from an algebraic structure called semiring. This framework is able to express, for example, fuzzy, classical, weighted, valued and over-constrained constraint problems. Classical constraint propagation has been extended and adapted to soft constraints by defining a schema for soft local consistency [BMR97]. On the other hand, in [Apt99a,Apt99b] it has been proved that most of the well known constraint propagation algorithms for classical constraints can be cast within a single schema. In this paper we combine these two schema and we show how the framework of [Apt99a,Apt99b] can be used for soft constraints. In doing so, we generalize the concept of soft local consistency, and we prove some convenient properties about its termination.
@conference{
11391_142636,
author = {Bistarelli, Stefano and Gennari, Rosella and Rossi, Francesca},
title = {Constraint Propagation for Soft Constraint Satisfaction Problems: Generalization and Termination Conditions},
year = {2000},
publisher = {Springer},
volume = {1894},
booktitle = {Principles and Practice of Constraint Programming - CP 2000: 6th International Conference},
abstract = {Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables’ values in each soft constraint are uniquely associated to elements from an algebraic structure called semiring. This framework is able to express, for example, fuzzy, classical, weighted, valued and over-constrained constraint problems. Classical constraint propagation has been extended and adapted to soft constraints by defining a schema for soft local consistency [BMR97]. On the other hand, in [Apt99a,Apt99b] it has been proved that most of the well known constraint propagation algorithms for classical constraints can be cast within a single schema.
In this paper we combine these two schema and we show how the framework of [Apt99a,Apt99b] can be used for soft constraints. In doing so, we generalize the concept of soft local consistency, and we prove some convenient properties about its termination.},
doi = {10.1007/3-540-45349-0_8},
pages = {83--97}
}
Downloads: 0
{"_id":"omwWhKBzRcLKaLy2R","bibbaseid":"bistarelli-gennari-rossi-constraintpropagationforsoftconstraintsatisfactionproblemsgeneralizationandterminationconditions-2000","author_short":["Bistarelli, S.","Gennari, R.","Rossi, F."],"bibdata":{"bibtype":"conference","type":"conference","author":[{"propositions":[],"lastnames":["Bistarelli"],"firstnames":["Stefano"],"suffixes":[]},{"propositions":[],"lastnames":["Gennari"],"firstnames":["Rosella"],"suffixes":[]},{"propositions":[],"lastnames":["Rossi"],"firstnames":["Francesca"],"suffixes":[]}],"title":"Constraint Propagation for Soft Constraint Satisfaction Problems: Generalization and Termination Conditions","year":"2000","publisher":"Springer","volume":"1894","booktitle":"Principles and Practice of Constraint Programming - CP 2000: 6th International Conference","abstract":"Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables’ values in each soft constraint are uniquely associated to elements from an algebraic structure called semiring. This framework is able to express, for example, fuzzy, classical, weighted, valued and over-constrained constraint problems. Classical constraint propagation has been extended and adapted to soft constraints by defining a schema for soft local consistency [BMR97]. On the other hand, in [Apt99a,Apt99b] it has been proved that most of the well known constraint propagation algorithms for classical constraints can be cast within a single schema. In this paper we combine these two schema and we show how the framework of [Apt99a,Apt99b] can be used for soft constraints. In doing so, we generalize the concept of soft local consistency, and we prove some convenient properties about its termination.","doi":"10.1007/3-540-45349-0_8","pages":"83–97","bibtex":"@conference{\n\t11391_142636,\n\tauthor = {Bistarelli, Stefano and Gennari, Rosella and Rossi, Francesca},\n\ttitle = {Constraint Propagation for Soft Constraint Satisfaction Problems: Generalization and Termination Conditions},\n\tyear = {2000},\n\tpublisher = {Springer},\n\tvolume = {1894},\n\tbooktitle = {Principles and Practice of Constraint Programming - CP 2000: 6th International Conference},\n\tabstract = {Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables’ values in each soft constraint are uniquely associated to elements from an algebraic structure called semiring. This framework is able to express, for example, fuzzy, classical, weighted, valued and over-constrained constraint problems. Classical constraint propagation has been extended and adapted to soft constraints by defining a schema for soft local consistency [BMR97]. On the other hand, in [Apt99a,Apt99b] it has been proved that most of the well known constraint propagation algorithms for classical constraints can be cast within a single schema.\r\nIn this paper we combine these two schema and we show how the framework of [Apt99a,Apt99b] can be used for soft constraints. In doing so, we generalize the concept of soft local consistency, and we prove some convenient properties about its termination.},\n\tdoi = {10.1007/3-540-45349-0_8},\t\n\tpages = {83--97}\n}\n","author_short":["Bistarelli, S.","Gennari, R.","Rossi, F."],"key":"11391_142636","id":"11391_142636","bibbaseid":"bistarelli-gennari-rossi-constraintpropagationforsoftconstraintsatisfactionproblemsgeneralizationandterminationconditions-2000","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"conference","biburl":"http://www.dmi.unipg.it/~bista/papers/pubblicazioni.bib","dataSources":["GhB5rb8JzW6az3exo"],"keywords":[],"search_terms":["constraint","propagation","soft","constraint","satisfaction","problems","generalization","termination","conditions","bistarelli","gennari","rossi"],"title":"Constraint Propagation for Soft Constraint Satisfaction Problems: Generalization and Termination Conditions","year":2000}