Abstract
Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables' values in each soft constraint are 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 constraint propagation [8]. On the other hand, in [1–3] it has been proven 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 schemas and we provide a more general framework where the schema of [3] can be used for soft constraints. In doing so, we generalize the concept of soft constraint propagation, and we provide new sufficient and independent conditions for its termination.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Apt, K. (1999a). The essence ofconstraint propagation. Theoretical Computer Science, 221(1-2): 179–210.
Apt, K. (1999b). The rough guide to constraint propagation (corrected version). In Proc. of the 5th International Conference on Principles and Practice of Constraint Programming (CP'99), pp. 1–23.
Apt, K. (2000). The role ofcommutativity in constraint propagation algorithms. ACM TOPLAS, 22(6): 1002–1036.
Bistarelli, S. (2001). Soft constraint solving and programming: A general framework. Ph.D. thesis, Dipartimento di Informatica, Università di Pisa, Italy.
Bistarelli, S., Codognet, P., Georget, Y., & Rossi, F. (2000a). Labeling and partial local consistency for soft constraint programming. In Proc. of the 2nd International Workshop on Practical Aspects of Declarative Languages (PADL'00).
Bistarelli, S., Codognet, P., & Rossi, F. (2000b). An abstraction framework for soft constraint and its relationship with constraint propagation. In Proc. SARA2000 Symposium on Abstraction, Reformulation and Approximation.
Bistarelli, S., Gennari, R., & Rossi, F. (2000c). Constraint propagation for soft constraint satisfaction problems: Generalization and termination conditions. In Proc. Sixth Int. Conf. on Principles and Practice of Constraint Programming (CP2000).
Bistarelli, S., Montanari, U., & Rossi, F. (1997). Semiring-based constraint solving and optimization. Journal of the ACM, 44(2): 201–236.
Dubois, D., Fargier, H., & Prade, H. (1993). The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In Proc. IEEE International Conference on Fuzzy Systems, pp. 1131–1136.
Fargier, H., & Lang, J. (1993). Uncertainty in constraint satisfaction problems: A probabilistic approach. In Proc. European Conference on Symbolic and Qualitative Approaches to Reasoning and Uncertainty (ECSQARU), pp. 97–104.
Freuder, E., & Wallace, R. (1992). Partial constraint satisfaction. AI Journal, 58.
Gennari, R. (2000). Arc consistency algorithms via iterations ofsubsumed functions. In Proc. of the 1st International Conference on Computational Logic (CL'00), pp. 358–372.
Marriott, K, & Stuckey, P. (1998). Programming with Constraints. MIT Press.
Schiex, T., Fargier, H., & Verfaille, G. (1995). Valued constraint satisfaction problems: Hard and easy problems. In Proc. IJCAI95. San Francisco, CA, pp. 631–637.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bistarelli, S., Gennari, R. & Rossi, F. General Properties and Termination Conditions for Soft Constraint Propagation. Constraints 8, 79–97 (2003). https://doi.org/10.1023/A:1021950728713
Issue Date:
DOI: https://doi.org/10.1023/A:1021950728713