An Abstraction Framework for Soft Constraints and Its Relationship with Constraint Propagation

Soft constraints are very flexible and expressive. However, they also are very complex to handle. For this reason, it may reasonable in several cases to pass to an abstract version of a given soft problem, and then to bring some useful information from the abstract problem to the concrete one. This will hopefully make the search for a solution, or for an optimal solution, of the concrete problem, faster. In this paper we review the main concepts and properties of our abstraction framework for soft constraints, and we show how it can be used to import constraint propagation algorithms from the abstract scenario to the concrete one. This may be useful when we don't have any (or any efficient) propagation algorithm in the concrete setting.

[1]  Thomas Schiex,et al.  Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison , 1995, Over-Constrained Systems.

[2]  Thomas Schiex,et al.  Possibilistic Constraint Satisfaction Problems or "How to Handle Soft Constraints?" , 1992, UAI.

[3]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[4]  Alan K. Mackworth.  Constraint Satisfaction , 1985 .

[5]  Francesca Rossi,et al.  Abstracting Soft Constraints , 1999, New Trends in Constraints.

[6]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[7]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[8]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[9]  Francesca Rossi,et al.  Semiring-based constraint solving and optimization , 1997 .

[10]  G. Birkhoff,et al.  A survey of modern algebra , 1942 .

[11]  Simon de Givry,et al.  Bounding the Optimum of Constraint Optimization Problems , 1997, CP.

[12]  Yan Georget,et al.  Compiling Semiring-Based Constraints with clp (FD, S) , 1998, CP.

[13]  D. Dubois,et al.  The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction , 1993, [Proceedings 1993] Second IEEE International Conference on Fuzzy Systems.

[14]  Michael J. Maher,et al.  Over-Constrained Systems , 1995, Lecture Notes in Computer Science.

[15]  Garrett Birkhoff,et al.  A survey of modern algebra , 1942 .

[16]  Fausto Giunchiglia,et al.  A Theory of Abstraction , 1992, Artif. Intell..

[17]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[18]  Z. Ruttkay.  Fuzzy constraint satisfaction , 1994, Proceedings of 1994 IEEE 3rd International Fuzzy Systems Conference.

[19]  Yves Caseau,et al.  Abstract Interpretation of Constraints on Order-Sorted Domains , 1991, ISLP.

[20]  Fausto Giunchiglia,et al.  Theories of Abstraction , 1997, AI Commun..