An abstraction framework for soft constraints and its relationship with constraint propagation

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1864, Issue , 2000, Pages 71-86

  Bistarelli, Stefano ^a   Codognet, Philippe ^b   Rossi, Francesca ^c  

^a UNIVERSITY OF PISA   (Italy)

^b SORBONNE UNIVERSITÉ   (France)

^c UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONCRETES;

CONSTRAINT PROPAGATION; CONSTRAINT PROPAGATION ALGORITHMS; OPTIMAL SOLUTIONS; PROPAGATION ALGORITHM; SOFT CONSTRAINT;

ABSTRACTING;

EID: 84942889171     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44914-0_5     Document Type: Conference Paper

References (17)

1. G. Birkhoff and S. MacLane. A Survey of Modern Algebra. MacMillan, 1965.
2. S. Bistarelli, P. Codognet, Y. Georget, and F. Rossi. Abstracting soft constraints. In K. Apt, E. Monfroy, T. Kakas, and F. Rossi, editors, Proc. 1999 ERCIM/Compulog Net workshop on Constraints, Springer LNAI, 2000, to appear.
3. S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and valued CSPs: Basic properties and comparison. In Over-Constrained Systems. Springer-Verlag, LNCS 1106, 1996.
4. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the ACM, 44(2):201-236, March 1997.
5. Y. Caseau. Abstract Interpretation of Constraints on Order-Sorted Domains. In Proc. ILPS91, MIT Press, 1991.
6. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Fourth ACM Symp. Principles of Programming Languages, pages 238-252, 1977.
7. P. Cousot and R. Cousot. Systematic design of program analyis. In Sixth ACM Symp. Principles of Programming Languages, pages 269-282, 1979.
8. D. Dubois, H. Fargier, and H. Prade. The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In Proc. IEEE International Conference on Fuzzy Systems, pages 1131-1136. IEEE, 1993.
9. Y. Georget and P. Codognet. Compiling semiring-based constraints with clp(fd, s). In M. Maher and J-F. Puget, editors, Proc. CP98. Springer-Verlag, LNCS 1520, 1998.
10. F. Giunchiglia, A. Villafiorita and T. Walsh. Theories of abstraction. AI Communication, 1997, vol. 10, n. 3-4, pp. 167-176.
11. F. Giunchiglia and T. Walsh. A theory of abstraction. Artificial Intelligence, 56(2-3):323-390, 1992.
12. S. de Givry, G. Verfaillie, and T. Schiex. Bounding The Optimum of Constraint Optimization Problems. In G. Smolka, editor, Proc. CP97, pages 405-419. Springer-Verlag, LNCS 1330, 1997.
13. A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99-118, 1977.
14. A. K. Mackworth. Constraint Satisfaction. Encyclopedia of AI (second edition), John Wiley & Sons, Stuart C. Shapiro ed., Vol. 1, pp. 285-293, 1992.
15. Zs. Ruttkay. Fuzzy constraint satisfaction. In Proc. 3rd IEEE International Conference on Fuzzy Systems, pages 1263-1268, 1994.
16. T. Schiex. Possibilistic constraint satisfaction problems, or "how to handle soft constraints?". In Proc. 8th Conf. of Uncertainty in AI, pages 269-275, 1992.
17. T. Schiex, H. Fargier, and G. Verfaillie. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proc. IJCAI95, pages 631-637. Morgan Kaufmann, 1995.