Soft constraint propagation and solving in constraint handling rules

Computational Intelligence

Volumn 20, Issue 2, 2004, Pages 287-307

  Bistarelli, S ^a,b   Fruhwirth T ^c   Marte, M ^d   Rossi, F ^e  

^a UNIVERSITY OF CHIETI   (Italy)

^b Istituto di informatica e telematica del Consiglio nazionale delle ricerche   (Italy)

^c UNIVERSITY OF ULM   (Germany)

^d UNIVERSITY OF MUNICH   (Germany)

^e UNIVERSITY OF PADOVA   (Italy)

Author keywords

Constraint languages; Constraint propagation; Constraint solving; Soft constraints

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; FUZZY SETS; OPTIMIZATION; SET THEORY;

CONSTRAINT LANGUAGES; CONSTRAINT PROPAGATION; CONSTRAINT SOLVING; SOFT CONSTRAINTS;

CONSTRAINT THEORY;

EID: 2442519270     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.0824-7935.2004.00239.x     Document Type: Conference Paper

References (19)

1. BISTARELLI, S. 2001. Soft constraint solving and programming: A general framework. Ph.D. Thesis, Dipartimento di Informatica, University of Pisa.
2. BISTARELLI, S., U. MONTANARI, and F. ROSSI. 1997. Semiring-based constraint solving and optimization. Journal of ACM, 44(2): 201-236.
3. BORNING, A., M. MAHER, A. MARTINDALE, and M. WILSON. 1989. Constraint hierarchies and logic programming. In Proceedings of the 6th International Conference on Logic Programming. Edited by M. Martelli and G. Levi. MIT Press, MA, pp. 149-164.
4. CARLSSON, M., and J. WIDEN. 1999. SICStus Prolog User's Manual. Swedish Institute of Computer Science (SICS). Available at http://www.sics.se/sicstus/.
5. CODOGNET, P., and D. DIAZ. 1996. Compiling constraints in CLP(FD). Journal of Logic Programming, 27(3): 185-226.
6. DECHTER, R. 1999. Bucket elimination: A unifying framework for reasoning. Artificial Inteligence, 113:41-85.
7. DUBOIS, D., H. FARGIER, and H. PRADE. 1993. The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In Proceedings of the IEEE International Conference on Fuzzy Systems. IEEE, pp. 1131-1136.
8. FREUDER, E. C., and R. J. WALLACE. 1992. Partial constraint satisfaction. AI Journal, 58:21-70.
9. FRÜHWIRTH, T. 1998. Theory and practice of constraint handling rules, special issue on constraint logic programming. Edited by P. J. Stuckey and K. Marriot. Journal of Logic Programming, 37(1-3):95-138.
10. FRÜHWIRTH, T., and S. ABDENNADHER. 2003. Essentials of Constraint Programming. Springer, New York.
11. GEORGET, Y., and P. CODOGNET. 1998. Compiling semiring-based constraints with clp(FD,S). In Proceedings of CP'98. Springer, New York.
12. LARROSA, J. 2000. Boosting search with variable elimination. In Proceedings of CP'00. Springer, New York.
13. MARRIOTT, K., and P. J. STUCKEY. 1998. Programming with Constraints: An Introduction. MIT Press, Cambridge, MA.
14. RUTTKAY, Z. 1994. Fuzzy constraint satisfaction. In Proceedings of the Third IEEE International Conference on Fuzzy Systems. IEEE, Orlando, FL.
15. SCHIEX, T. 1992. Possibilistic constraint satisfaction problems, or "How to handle soft constraints?" In Proceedings of the Eigth Conference of Uncertainty in AI, Morgan Kaufman, Stanford, CA.
16. SCHIEX, T., H. FARGIER, and G. VERFAILLIE. 1995. Valued constraint satisfaction problems: Hard and easy problems. In Proceedings of IJCAI95. Morgan Kaufmann, pp. 631-637.
17. SCHIEX, T. 2000. Arc consistency for soft constraints. In Proceedings of CP'00. Springer, New York.
18. VAN HENTENRYCK, P. 1989. Constraint Satisfaction in Logic Programming. MIT Press, MA.
19. VAN HENTENRYCK, P., T. Pesson, and J. L. Poget. 2000. Search and strategies in OPL. ACM Transactions on Computational Logic, 1(2):285-320.