...
首页> 外文期刊>Electronic Colloquium on Computational Complexity >Dependency Schemes in QBF Calculi:Semantics and Soundness
【24h】

Dependency Schemes in QBF Calculi:Semantics and Soundness

机译:QBF计算中的依赖性方案:语义和健全性

获取原文
   

获取外文期刊封面封底 >>

       

摘要

We study the parametrisation of QBF resolution calculi by dependency schemes. One of the main problems in this area is to understand for which dependency schemes the resulting calculi are sound. Towards this end we propose a semantic framework for variable independence based on `exhibition' by QBF models, and use it to express a property of dependency schemes called `full exhibition' that is known to be sufficient for soundness in Q-resolution. Introducing a generalised form of the long-distance resolution rule, we propose a complete parametrisation of classical long-distance Q-resolution, and show that full exhibition remains sufficient for soundness. We demonstrate that our approach applies to the current research frontiers by proving that the reflexive resolution path dependency scheme is fully exhibited.
机译:我们通过依赖方案研究了QBF分辨率计算的参数化。该领域的主要问题之一是要了解所产生的结石对哪些依赖方案是合理的。为此,我们提出了一个基于QBF模型基于“展示”的变量独立性语义框架,并使用它来表达一种称为“全面展示”的依赖方案的属性,该方案已足以满足Q分辨率的要求。在介绍长距离分辨率规则的广义形式时,我们提出了经典的长距离Q分辨率的完整参数化,并表明完整的展示对于声音的稳定性仍然足够。通过证明自反分辨率路径依赖方案得到充分展示,我们证明了我们的方法适用于当前的研究前沿。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号