تقرير
Approximation Strategies for Incomplete MaxSAT
| العنوان: | Approximation Strategies for Incomplete MaxSAT |
|---|---|
| المؤلفون: | Joshi, Saurabh, Kumar, Prateek, Martins, Ruben, Rao, Sukrut |
| سنة النشر: | 2018 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Logic in Computer Science, Computer Science - Artificial Intelligence |
| الوصف: | Incomplete MaxSAT solving aims to quickly find a solution that attempts to minimize the sum of the weights of the unsatisfied soft clauses without providing any optimality guarantees. In this paper, we propose two approximation strategies for improving incomplete MaxSAT solving. In one of the strategies, we cluster the weights and approximate them with a representative weight. In another strategy, we break up the problem of minimizing the sum of weights of unsatisfiable clauses into multiple minimization subproblems. Experimental results show that approximation strategies can be used to find better solutions than the best incomplete solvers in the MaxSAT Evaluation 2017. Comment: 10 pages, 3 algorithms, 1 figure, International Conference on Principles and Practice of Constraint Programming (CP) 2018 |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/1806.07164 |
| رقم الأكسشن: | edsarx.1806.07164 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |