Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Arc-consistency and arc-consistency again
Artificial Intelligence
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
The essence of constraint propagation
Theoretical Computer Science
Labeling and Partial Local Consistency for Soft Constraint Programming
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
The Rough Guide to Constraint Propagation
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Generalized Arc Consistency with Application to MaxCSP
AI '02 Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Improving the distributed constraint optimization using social network analysis
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
Implementing semiring-based constraints using mozart
MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz
Explaining constraint programming
Processes, Terms and Cycles
| Hi-index | 0.00 |
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.