Enhanced Unsatisfiable Cores for QBF: Weakening Universal to Existential Quantifiers

Viktor Schuppan
{"title":"Enhanced Unsatisfiable Cores for QBF: Weakening Universal to Existential Quantifiers","authors":"Viktor Schuppan","doi":"10.1109/ICTAI.2018.00023","DOIUrl":null,"url":null,"abstract":"We propose an enhanced notion of unsatisfiable cores for QBF in prenex CNF that weakens universal to existential quantifiers in addition to the traditional removal of clauses. We can thus obtain unsatisfiable cores that are semantically different from those obtained by the traditional notion; this gives rise to explanations - and, via hitting set duality, diagnoses - of unsatisfiability that are not provided by traditional unsatisfiable cores. We use a source-to-source transformation on QBF that reduces the weakening of universal to existential quantifiers to the removal of clauses. This enables any tool or method that can compute unsatisfiable cores of the traditional notion to also compute unsatisfiable cores of our enhanced notion. We implement our approach in the QBF solver DepQBF, and we experimentally evaluate it on a subset of QBFLIB. Several case studies illustrate that interesting information can be learned from our enhanced notion of unsatisfiable cores.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"1 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2018.00023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We propose an enhanced notion of unsatisfiable cores for QBF in prenex CNF that weakens universal to existential quantifiers in addition to the traditional removal of clauses. We can thus obtain unsatisfiable cores that are semantically different from those obtained by the traditional notion; this gives rise to explanations - and, via hitting set duality, diagnoses - of unsatisfiability that are not provided by traditional unsatisfiable cores. We use a source-to-source transformation on QBF that reduces the weakening of universal to existential quantifiers to the removal of clauses. This enables any tool or method that can compute unsatisfiable cores of the traditional notion to also compute unsatisfiable cores of our enhanced notion. We implement our approach in the QBF solver DepQBF, and we experimentally evaluate it on a subset of QBFLIB. Several case studies illustrate that interesting information can be learned from our enhanced notion of unsatisfiable cores.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
QBF的增强不满足核:弱化全称到存在量词
我们提出了一种增强的前缀CNF中QBF的不满意核概念,除了传统的去除从句外,还将全称量词削弱为存在量词。因此,我们可以得到语义上不同于传统概念所得到的不满意的核心;这就产生了传统的不能满足核心所不能提供的对不能满足性的解释——以及通过触及集合对偶性而进行的诊断。我们在QBF上使用了源到源的转换,减少了全称量词到存在量词的弱化到从句的去除。这使得任何可以计算传统概念的不满意核心的工具或方法也可以计算我们增强概念的不满意核心。我们在QBF求解器DepQBF中实现了我们的方法,并在QBFLIB的一个子集上进行了实验评估。几个案例研究表明,从我们增强的“不满意核心”概念中可以学到有趣的信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
[Title page i] Enhanced Unsatisfiable Cores for QBF: Weakening Universal to Existential Quantifiers Effective Ant Colony Optimization Solution for the Brazilian Family Health Team Scheduling Problem Exploiting Global Semantic Similarity Biterms for Short-Text Topic Discovery Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting
×
引用
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