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

一种改进的正则归结与池归结分离及子句学习

An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning

Maria Luisa Bonet, Sam Buss

摘要:

我们证明了图重言式原则的Alekhnovich,Johannsen,Pitassi和Urquhart有多项式大小池分辨率反驳,只使用输入引理作为学习条款,没有退化的决议推断。我们还证明,这些图重言式的原则可以反驳多项式大小的DPLL证明与子句学习,即使限制在贪婪,单位传播的DPLL搜索。

英文摘要:

We prove that the graph tautology principles of Alekhnovich, Johannsen, Pitassi and Urquhart have polynomial size pool resolution refutations that use only input lemmas as learned clauses and without degenerate resolution inferences. We also prove that these graph tautology principles can be refuted by polynomial size DPLL proofs with clause learning, even when restricted to greedy, unit-propagating DPLL search.

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

↑