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

论枚举简短的投影模型

On Enumerating Short Projected Models

Sibylle Möhle, Roberto Sebastiani, Armin Biere

AI总结:

针对命题模型枚举中避免重复的问题,提出两种采用对偶推理缩短模型长度的算法,分别基于对偶编码的阻塞子句和调整冲突驱动子句学习过程实现无阻塞子句枚举,并提供了正确性证明。

摘要:

命题模型枚举,或称 All-SAT,是记录命题公式所有模型的任务。它是软件和硬件验证、系统工程以及谓词抽象等关键任务。它还提供了一种将 CNF 公式转换为 DNF 的手段,这在电路设计中很相关。虽然在某些应用中多次枚举模型不会造成危害,但在其他应用中避免重复至关重要。因此,我们提出了两种模型枚举算法,它们采用对偶推理以缩短找到的模型。第一种方法枚举成对矛盾的模型。通过使用所谓的阻塞子句来避免重复,我们为其提供了对偶编码。在第二种方法中,我们放宽了唯一性约束。我们对标准的冲突驱动子句学习过程进行了调整,以支持无阻塞子句的模型枚举。我们的过程通过演算来表达,并提供了正确性证明。

英文摘要:

Propositional model enumeration, or All-SAT, is the task to record all models of a propositional formula. It is a key task in software and hardware verification, system engineering, and predicate abstraction, to mention a few. It also provides a means to convert a CNF formula into DNF, which is relevant in circuit design. While in some applications enumerating models multiple times causes no harm, in others avoiding repetitions is crucial. We therefore present two model enumeration algorithms, which adopt dual reasoning in order to shorten the found models. The first method enumerates pairwise contradicting models. Repetitions are avoided by the use of so-called blocking clauses, for which we provide a dual encoding. In our second approach we relax the uniqueness constraint. We present an adaptation of the standard conflict-driven clause learning procedure to support model enumeration without blocking clauses.Our procedures are expressed by means of a calculus and proofs of correctness are provided.

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

↑