Superredundancy: A tool for Boolean formula minimization complexity analysis

P. Liberatore
{"title":"Superredundancy: A tool for Boolean formula minimization complexity analysis","authors":"P. Liberatore","doi":"10.48550/arXiv.2205.00762","DOIUrl":null,"url":null,"abstract":"A superredundant clause is a clause that is redundant in the resolution closure of a formula. The converse concept of superirredundancy ensures membership of the clause in all minimal CNF formulae that are equivalent to the given one. This allows for building formulae where some clauses are fixed when minimizing size. An example are proofs of complexity hardness of the problems of minimal formula size. Others are proofs of size when forgetting variables or revising a formula. Most clauses can be made superirredundant by splitting them over a new variable.","PeriodicalId":11639,"journal":{"name":"Electron. Colloquium Comput. Complex.","volume":"65 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electron. Colloquium Comput. Complex.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2205.00762","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A superredundant clause is a clause that is redundant in the resolution closure of a formula. The converse concept of superirredundancy ensures membership of the clause in all minimal CNF formulae that are equivalent to the given one. This allows for building formulae where some clauses are fixed when minimizing size. An example are proofs of complexity hardness of the problems of minimal formula size. Others are proofs of size when forgetting variables or revising a formula. Most clauses can be made superirredundant by splitting them over a new variable.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
超级冗余:布尔公式最小化复杂性分析的工具
超级冗余子句是在公式的解析闭包中冗余的子句。超冗余的逆概念保证了子句在所有等价于给定子句的最小CNF公式中的隶属性。这允许构建公式,其中一些子句在最小化尺寸时是固定的。一个例子是最小公式大小问题的复杂性和硬度的证明。另一些则是在忘记变量或修改公式时证明大小。通过将子句拆分到一个新变量上,大多数子句都可以变得冗余。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dependency schemes in CDCL-based QBF solving: a proof-theoretic study On blocky ranks of matrices Fractional Linear Matroid Matching is in quasi-NC Aaronson-Ambainis Conjecture Is True For Random Restrictions Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1