Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.07432 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929674288889856 |
|---|---|
| author | Petrova, Aleksandra Larrosa, Javier Rollón, Emma |
| author_facet | Petrova, Aleksandra Larrosa, Javier Rollón, Emma |
| contents | SAT technology has proven to be surprisingly effective in a large variety of domains. However, for the Weighted CSP problem dedicated algorithms have always been superior. One approach not well-studied so far is the use of SAT in conjunction with the Implicit Hitting Set approach. In this work, we explore some alternatives to the existing algorithm of reference. The alternatives, mostly borrowed from related boolean frameworks, consider trade-offs for the two main components of the IHS approach: the computation of low-cost hitting vectors, and their transformation into high-cost cores. For each one, we propose 4 levels of intensity. Since we also test the usefulness of cost function merging, our experiments consider 32 different implementations. Our empirical study shows that for WCSP it is not easy to identify the best alternative. Nevertheless, the cost-function merging encoding and extracting maximal cores seems to be a robust approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_07432 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Empirical Evaluation of the Implicit Hitting Set Approach for Weighted CSPs Petrova, Aleksandra Larrosa, Javier Rollón, Emma Artificial Intelligence SAT technology has proven to be surprisingly effective in a large variety of domains. However, for the Weighted CSP problem dedicated algorithms have always been superior. One approach not well-studied so far is the use of SAT in conjunction with the Implicit Hitting Set approach. In this work, we explore some alternatives to the existing algorithm of reference. The alternatives, mostly borrowed from related boolean frameworks, consider trade-offs for the two main components of the IHS approach: the computation of low-cost hitting vectors, and their transformation into high-cost cores. For each one, we propose 4 levels of intensity. Since we also test the usefulness of cost function merging, our experiments consider 32 different implementations. Our empirical study shows that for WCSP it is not easy to identify the best alternative. Nevertheless, the cost-function merging encoding and extracting maximal cores seems to be a robust approach. |
| title | Empirical Evaluation of the Implicit Hitting Set Approach for Weighted CSPs |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2501.07432 |