Abstracting soft constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1865, Issue , 2000, Pages 108-138

  Bistarelli, S ^a   Codognet, P ^b   Georget, Y ^c   Rossi, F ^d  

^a UNIVERSITY OF PISA   (Italy)

^b SORBONNE UNIVERSITÉ   (France)

^c INRIA Roquencourt   (France)

^d UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

A-STABLE; OPTIMAL SOLUTIONS; SOFT CONSTRAINT;

ABSTRACTING;

EID: 35048889882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44654-0_6     Document Type: Conference Paper

References (22)

1. G. Birkhoff and S. MacLane. A Survey of Modern Algebra. MaCMillan, 1965. 2. S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and valued CSPs: Basic properties and comparison. In OverConstrained Systems. Springer-Verlag, LNCS 1106, 1996.
2. S. Bistarelli, U. Montanari, and F. Rossi. Constraint Solving over Semirings. In Proc. IJCAI95. Morgan Kaufman, 1995.
3. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the ACM, 44(2):201-236, March 1997.
4. 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.
5. P. Cousot and R. Cousot. Systematic design of program analyis. In Sixth ACM Symp. Principles of Programming Languages, pages269-282, 1979.
6. S. de Givry, G. Verfaille, and T. Schiex. Bounding The Optimum of Constraint Optimization Problems. In G. Smolka, editor, Proc. CP97, pages 405-419. Springer-Verlag, LNCS 1330, 1997.
7. 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.
8. Thomas Ellman. Synthesis of abstraction hierarchies for constraint satisfaction by clustering approximately equivalent objects. In Proceedings of International Conference on Machine Learning, pages 104-111, 1993.
9. H. Fargier and J. Lang. Uncertainty in constraint satisfaction problems: a probabilistic approach. In Proc. European Conference on Symbolic and Qualitative Approaches to Reasoning and Uncertainty (ECSQARU), pages 97-104. SpringerVerlag, LNCS 747, 1993.
10. E. C. Freuder. Eliminating interchangeable values in constraint satisfaction subproblems. In Proc. AAAI-91, 1991.
11. E. C. Freuder and D Sabin. Interchangeability supports abstraction and reformulation for constraint satisfaction. In Proceedings of Symposium on Abstraction, Reformulation and Approximation (SARA'95), 1995. http://www.cs.unh.edu/csprojects/csp/csp.html.
12. E. C. Freuder and R. J. Wallace. Partial constraint satisfaction. AI Journal, 58, 1992.
13. 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.
14. F. Giunchiglia, A. Villafiorita, and T. Walsh. Theories of abstraction. AI Communication, 10(3-4):167-176, 1997.
15. F. Giunchiglia and T. Walsh. A theory of abstraction. Artificial Intelligence, 56(2-3):323-390, 1992.
16. A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99-118, 1977.
17. A.K. Mackworth. Constraint satisfaction. In Stuart C. Shapiro, editor, Encyclopedia of AI (second edition), volume 1, pages 285-293. John Wiley & Sons, 1992.
18. Zs. Ruttkay. Fuzzy constraint satisfaction. In Proc. 3rd IEEE International Conference on Fuzzy Systems, pages 1263-1268, 1994.
19. T. Schiex. Possibilistic constraint satisfaction problems, or \how to handle softconstraints?". In Proc. 8th Conf. of Uncertainty in AI, pages 269-275, 1992.
20. T. Schiex, H. Fargier, and G. Verfaille. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proc. IJCAI95, pages 631-637. Morgan Kaufmann, 1995.
21. R. Schrag and D. Miranker. An evaluation of domain reduction: Abstraction for unstructured csps. In Proceedings of the Symposiumon Abstraction, Reformulation, and Approximation, pages 126-133, 1992. http://www.cs.utexas.edu/users/schrag/SARA.ps.
22. M. Wallace. Practical applications of constraint programming. Constraints: An International Journal, 1, 1996.