Name
Abstract | ||
|---|---|---|
Usual techniques to solve WCSP are based on cost transfer operations coupled with a branch and bound algorithm. In this paper, we focus on an approach integrating extraction and relaxation of Minimal Unsatisfiable Cores in order to solve this problem. We derive our approach in two ways: an incomplete, greedy, algorithm and a complete one. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ICTAI.2013.140 | international conference on tools with artificial intelligence |
Keywords | DocType | Volume |
minimal unsatisfiable cores,cost transfer operation,usual technique,bound algorithm,minimisation,greedy algorithms,constraint satisfaction problems | Conference | abs/1304.5449 |
ISSN | Citations | PageRank |
1082-3409 | 2 | 0.44 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christophe Lecoutre | 1 | 709 | 45.10 |
| Nicolas Paris | 2 | 4 | 1.16 |
| Olivier Roussel | 3 | 283 | 21.63 |
| Sébastien Tabary | 4 | 66 | 6.58 |