首页> 外文会议>Mexican conference on pattern Recognition >Computing #2SAT and #2UNSAT by Binary Patterns
【24h】

Computing #2SAT and #2UNSAT by Binary Patterns

机译:通过二进制模式计算#2SAT和#2UNSAT

获取原文

摘要

We present some results about the parametric complexity of #2SAT and #2UNSAT, which consist on counting the number of models and falsifying assignments, respectively, for two Conjunctive Forms (2-CF's) . Firstly, we show some cases where given a formula F, #2SAT(F) can be bounded above by considering a binary pattern analysis over its set of clauses. Secondly, since #2SAT(F) = 2~n-#2UNSAT(F) we show that, by considering the constrained graph Gf of F, if Gf represents an acyclic graph then, #UNSAT(F) can be computed in polynomial time. To the best of our knowledge, this is the first time where #2UNSAT is computed through its constrained graph, since the inclusion-exclusion formula has been commonly used for computing #UNSAT(F).
机译:我们给出了有关#2SAT和#2UNSAT的参数复杂度的一些结果,其中包括分别计算两个合取形式(2-CF's)的模型数量和伪造分配。首先,我们展示了在给定公式F的情况下,可以通过考虑对其子句集进行二进制模式分析来限制#2SAT(F)的范围。其次,由于#2SAT(F)= 2〜n-#2UNSAT(F)我们表明,通过考虑F的约束图Gf,如果Gf表示一个无环图,则#UNSAT(F)可以在多项式时间内计算。据我们所知,这是第一次通过约束图计算#2UNSAT,因为包含-排除公式已普遍用于计算#UNSAT(F)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号