Benchmark Instances for MUS Computation
收藏arXiv2025-09-30 收录
下载链接：
https://github.com/ML-KULeuven/SymmetryMUS
下载链接
链接失效反馈官方服务：
资源简介：
该数据集是一组基准实例，包含了一系列不可满足约束问题，这些问题被编码为伪布尔问题，其中包括鸽巢问题、n+k皇后问题和背包问题。具体来说，该数据集包括146个鸽巢问题、66个n+k皇后问题和60个背包问题，总共有272个实例。这些数据被用于评估各种MUS（最小不可满足子集）计算算法的性能。任务涉及MUS的计算与枚举。
This dataset comprises a set of benchmark instances encompassing a range of unsatisfiable constraint problems encoded as pseudo-Boolean problems, including the pigeonhole problem, the n+k queens problem, and the knapsack problem. Specifically, it contains 146 instances of the pigeonhole problem, 66 instances of the n+k queens problem, and 60 instances of the knapsack problem, totaling 272 instances in all. This dataset is used to evaluate the performance of various MUS (Minimal Unsatisfiable Subset) computation algorithms, and the tasks involve the computation and enumeration of MUSes.
