arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.3011cs.LO
收藏

计算命题公式上的极小集I:问题与约简

Computing Minimal Sets on Propositional Formulae I: Problems & Reductions

Joao Marques-Silva, Mikolas Janota

摘要:

布尔可满足性(SAT)是典型的NP完全决策问题。近年来,可满足性问题求解算法的研究取得了很大的进展,并得到了越来越多的实际应用。然而,SAT的许多实际应用涉及解决函数而不是决策问题。具体的例子包括计算最小不可满足子集、最小校正子集、素蕴涵和蕴涵、最小模型、主干文字和自给自足等。在大多数情况下,解决函数问题需要对SAT求解器进行许多自适应或非自适应调用。考虑到SAT的计算复杂性,因此重要的是开发需要对SAT求解器进行尽可能少的调用或涉及更简单实例的算法。本文讨论了一些有代表性的功能问题上定义的布尔公式,并表明,所有这些功能问题可以减少到一个通用的问题,计算最小集受单调谓词。这个问题被称为单调谓词上的最小集合(MSMP)问题。这个练习为解决著名的函数问题提供了新的方法,包括素数蕴涵,最小校正子集,主干文字,自变量和自给自足等。此外,这项工作激励更有效的算法的MSMP问题的发展。最后,本文概述了一些未来的研究领域与扩展的MSMP问题。

英文摘要:

Boolean Satisfiability (SAT) is arguably the archetypical NP-complete decision problem. Progress in SAT solving algorithms has motivated an ever increasing number of practical applications in recent years. However, many practical uses of SAT involve solving function as opposed to decision problems. Concrete examples include computing minimal unsatisfiable subsets, minimal correction subsets, prime implicates and implicants, minimal models, backbone literals, and autarkies, among several others. In most cases, solving a function problem requires a number of adaptive or non-adaptive calls to a SAT solver. Given the computational complexity of SAT, it is therefore important to develop algorithms that either require the smallest possible number of calls to the SAT solver, or that involve simpler instances. This paper addresses a number of representative function problems defined on Boolean formulas, and shows that all these function problems can be reduced to a generic problem of computing a minimal set subject to a monotone predicate. This problem is referred to as the Minimal Set over Monotone Predicate (MSMP) problem. This exercise provides new ways for solving well-known function problems, including prime implicates, minimal correction subsets, backbone literals, independent variables and autarkies, among several others. Moreover, this exercise motivates the development of more efficient algorithms for the MSMP problem. Finally the paper outlines a number of areas of future research related with extensions of the MSMP problem.

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

↑