On the Structure of Solution-Graphs for Boolean Formulas
On the Structure of Solution-Graphs for Boolean Formulas
复制标题
布尔公式解图的结构
DOI:
10.1007/978-3-319-22177-9_10
复制
发表时间:
2015
期刊:
影响因子:
--
通讯作者:
Patrick Scharpfenecker
中科院分区:
文献类型:
--
作者:
Patrick Scharpfenecker
In this work we extend the study of solution graphs and prove that for boolean formulas in a class called CPSS, all connected components are partial cubes of small dimension, a statement which was proved only for some cases in [16]. In contrast, we show that general Schaefer formulas are powerful enough to encode graphs of exponential isometric dimension and graphs which are not even partial cubes.Our techniques shed light on the detailed structure ofst-connectivity for Schaefer and connectivity for CPSS formulas, problems which were already known to be solvable in polynomial time. We refine this classification and show that the problems in these cases are equivalent to the satisfiability problem of related formulas by giving mutual reductions between (st-)connectivity and satisfiability. An immediate consequence is thatst-connectivity in (undirected) solution graphs of Horn-formulas is P-complete while for 2SATformulasst-connectivity is NL-complete.
登录
查看更多内容
DOI:
10.1016/s0019-9958(86)80009-2
发表时间:
1986
期刊:
Inf. Control.
影响因子:
--
作者:
C. Papadimitriou;M. Yannakakis
通讯作者:
M. Yannakakis
DOI:
10.1145/1008354.1008356
发表时间:
1977
期刊:
SIGACT News
影响因子:
--
作者:
L. Goldschlager
通讯作者:
L. Goldschlager
DOI:
10.3233/sat190097
发表时间:
2013
期刊:
ArXiv
影响因子:
--
作者:
Konrad W. Schwerdtfeger
通讯作者:
Konrad W. Schwerdtfeger
DOI:
10.1007/978-3-319-04921-2_23
发表时间:
2014
期刊:
2021 IEEE/ACM 43rd International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP)
影响因子:
--
作者:
Bireswar Das;Patrick Scharpfenecker;J. Torán
通讯作者:
J. Torán
影响因子:
0.5
作者:
H. Veith
通讯作者:
H. Veith