论文标题
您对此部分作业感到满意吗？
Are You Satisfied by This Partial Assignment?
论文作者
论文摘要
许多针对SAT和SAT相关问题的程序 - 特别是对于那些需要完全列举满足真相分配的人 - 依靠其效率来检测满足输入公式的部分任务。在本文中，我们分析了部分分配令人满意的概念，尤其是在处理非CNF和存在量化的公式时 - 提出了有关此概念的歧义和微妙之处的旗帜，并研究了它们的实际后果。这可能会推动开发更有效的分配 - 数量算法。
Many procedures for SAT and SAT-related problems -- in particular for those requiring the complete enumeration of satisfying truth assignments -- rely their efficiency on the detection of partial assignments satisfying an input formula. In this paper we analyze the notion of partial-assignment satisfiability -- in particular when dealing with non-CNF and existentially-quantified formulas -- raising a flag about the ambiguities and subtleties of this concept, and investigating their practical consequences. This may drive the development of more effective assignment-enumeration algorithms.
