arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2305.16191cs.AIcs.LO
收藏

UpMax:面向MaxSAT的用户划分

UpMax: User partitioning for MaxSAT

INESC-ID(INESC-ID(葡萄牙系统与计算机工程研究所));Instituto Superior Técnico(高等技术学院);Universidade de Lisboa(里斯本大学);Carnegie Mellon University(卡内基梅隆大学)

Pedro Orvalho, Vasco Manquinho, Ruben Martins

AI总结:

本文提出UpMax框架,将MaxSAT求解中的用户划分过程与求解算法解耦,使用户可基于问题知识自定义划分方案,从而显著提升基于不可满足性的MaxSAT算法性能。

摘要:

已有研究表明,最大可满足性(MaxSAT)问题实例可以通过将软子句集合划分为若干不相交集合来有效求解。划分方法可以基于子句权重(例如分层),也可以基于公式的图表示。随后,应用合并过程以保证找到最优解。本文提出了一个名为UpMax的新框架,将划分过程与MaxSAT求解算法解耦。因此,新的划分过程可以独立于所使用的MaxSAT算法来定义。此外,这种解耦还允许构建新MaxSAT公式的用户基于待求解问题的知识提出划分方案。我们使用若干问题说明了这一方法,并表明划分对基于不可满足性的MaxSAT算法的性能有很大影响。

英文摘要:

It has been shown that Maximum Satisfiability (MaxSAT) problem instances can be effectively solved by partitioning the set of soft clauses into several disjoint sets. The partitioning methods can be based on clause weights (e.g., stratification) or based on graph representations of the formula. Afterwards, a merge procedure is applied to guarantee that an optimal solution is found. This paper proposes a new framework called UpMax that decouples the partitioning procedure from the MaxSAT solving algorithms. As a result, new partitioning procedures can be defined independently of the MaxSAT algorithm to be used. Moreover, this decoupling also allows users that build new MaxSAT formulas to propose partition schemes based on knowledge of the problem to be solved. We illustrate this approach using several problems and show that partitioning has a large impact on the performance of unsatisfiability-based MaxSAT algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑