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

逻辑中的冗余II:2CNF与Horn命题公式

Redundancy in Logic II: 2CNF and Horn Propositional Formulae

Paolo Liberatore

摘要:

我们报告的复杂性结果的冗余公式的2CNF形式。我们首先考虑的问题,检查冗余,并显示一些算法,略优于平凡的。然后,我们分析了相关的问题,找到非冗余等价子集(I.E.S.)一个给定的集合。循环性的概念被证明与这些问题的复杂性有关。给出了Horn公式的一些结果。

英文摘要:

We report complexity results about redundancy of formulae in 2CNF form. We first consider the problem of checking redundancy and show some algorithms that are slightly better than the trivial one. We then analyze problems related to finding irredundant equivalent subsets (I.E.S.) of a given set. The concept of cyclicity proved to be relevant to the complexity of these problems. Some results about Horn formulae are also shown.

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

↑