Download:
|
by S. Bistarelli, P. Codognet, F. Rossi
In
ftp://ftp.di.unipi.it/pub/Papers/bista/abs-sara.ps.gz
Add To MetaCart
Abstract:
Abstract. 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
Citations
|
1309
|
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
– Cousot, Cousot
- 1977
|
|
891
|
Consistency in a network of relations
– Mackworth
- 1977
|
|
227
|
Valued constraint satisfaction problems: hard and easy problems
– Schiex, Fargier, et al.
- 1995
|
|
158
|
A theory of abstraction
– Giunchiglia, Walsh
- 1992
|
|
151
|
Semi-Ring-based Constraint Solving and Optimization
– Bistarelli, Montanari, et al.
- 1997
|
|
85
|
Possibilistic constraint satisfaction problems, or "How to handle soft constraints
– Schiex
- 1992
|
|
79
|
Fuzzy constraint satisfaction
– Ruttkay
- 1994
|
|
72
|
A Survey of Modern Algebra
– Birkhoff, Lane
- 1997
|
|
71
|
The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction
– Dubois, Fargier, et al.
- 1993
|
|
38
|
Semiring-based CSPs and Valued CSPs: Basic properties and comparison
– Bistarelli, Fargier, et al.
- 1996
|
|
36
|
Compiling semiring-based constraints with clp(FD,S
– Georget, Codognet
- 1998
|
|
20
|
Bounding the optimum of Constraint Optimization Problems
– Givry, Verfaillie, et al.
- 1997
|
|
19
|
Constraint satisfaction,” in Encyclopedia of Artificial Intelligence
– Mackworth
- 1987
|
|
11
|
Abstract interpretation of constraints on order-sorted domains
– Caseau
- 1991
|
|
8
|
Abstracting soft constraint
– Bistarelli, Codognet, et al.
- 1999
|
|
3
|
Systematic design of program analyis
– Cousot, Cousot
- 1979
|
