General properties and termination conditions for soft constraint propagation

Constraints

Volumn 8, Issue 1, 2003, Pages 79-97

  Bistarelli, S ^a   Gennari, R ^b   Rossi, F ^c  

^a CNR   (Italy)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c UNIVERSITY OF PADOVA   (Italy)

Author keywords

Generic algorithm schema; Semiring; Soft constraint propagation; Soft constraints; Termination

Indexed keywords

FUZZY SETS; GENETIC ALGORITHMS; PROBLEM SOLVING;

SOFT CONSTRAINT PROPAGATION;

CONSTRAINT THEORY;

EID: 0037284793     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021950728713     Document Type: Article

References (14)

1. Apt, K. (1999a). The essence of constraint propagation. Theoretical Computer Science, 221(1-2): 179-210.
2. Apt, K. (1999b). The rough guide to constraint propagation (corrected version). In Proc. of the 5th Inter-national Conference on Principles and Practice of Constraint Programming (CP'99), pp. 1-23.
3. Apt, K. (2000). The role of commutativity in constraint propagation algorithms. ACM TOPLAS, 22(6): 1002-1036.
4. Bistarelli, S. (2001). Soft constraint solving and programming: A general framework. Ph.D. thesis, Dipartimento di Informatica, Università di Pisa, Italy.
5. 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).
6. 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.
7. 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).
8. Bistarelli, S., Montanari, U., & Rossi, F. (1997). Semiring-based constraint solving and optimization. Journal of the ACM, 44(2): 201-236.
9. 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.
10. 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.
11. Freuder, E., & Wallace, R. (1992). Partial constraint satisfaction. AI Journal, 58.
12. Gennari, R. (2000). Arc consistency algorithms via iterations of subsumed functions. In Proc. of the 1st International Conference on Computational Logic (CL'00), pp. 358-372.
13. Marriott, K, & Stuckey, P. (1998). Programming with Constraints. MIT Press.
14. Schiex, T., Fargier, H., & Verfaille, G. (1995). Valued constraint satisfaction problems: Hard and easy problems. In Proc. IJCAI95. San Francisco, CA, pp. 631-637.