当前位置: X-MOL 学术Log. J. IGPL › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A bottom-up algorithm for solving ♯2SAT
Logic Journal of the IGPL ( IF 0.6 ) Pub Date : 2020-05-05 , DOI: 10.1093/jigpal/jzaa009
Guillermo De Ita 1 , J Raymundo Marcial-Romero 2 , J A HernÁndez-ServÍn 2
Affiliation  

Counting models for a two conjunctive formula (2-CF) |$F$|⁠, a problem known as |$\sharp $|2Sat, is a classic |$\sharp $|P complete problem. Given a 2-CF |$F$| as input, its constraint graph |$G$| is built. If |$G$| is acyclic, then |$\sharp $|2Sat(⁠|$F$|⁠) can be computed efficiently. In this paper, we address the case when |$G$| has cycles.

中文翻译:

求解♯2SAT的自底向上算法

为两个联合公式(2-CF)| $ F $ |⁠计算模型,这个问题称为| $ \ sharp $ | 2 Sat是经典| $ \ sharp $ | P完全问题。给定2-CF | $ F $ | 作为输入,其约束图| $ G $ | 建成。如果| $ G $ | 是非循环的,则| $ \ sharp $ | 2卫星⁠| $ F $ |⁠)可以有效地计算出来。在本文中,我们处理当| $ G $ |时的情况有周期。
更新日期:2020-05-05
down
wechat
bug