On the Structure of Solution-Graphs for Boolean Formulas
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 . 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 of st-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 that st-connectivity in (undirected) solution graphs of Horn-formulas is P-complete while for 2SAT formulas st-connectivity is NL-complete.
KeywordsPartial cube Succinct Embedding st-Connectivity Connectivity Satisfiability
- 3.Balcázar, J.L., Lozano, A., Torán, J.: The complexity of algorithmic problems on succinct instances. In: Baeza-Yates, R., Manber, U. (eds.) Computer Science, Research and Applications. Springer, New York (1992)Google Scholar
- 4.Bonsma, P., Mouawad, A.E., Nishimura, N., Raman, V.: The complexity of bounded length graph recoloring and CSP reconfiguration. In: Cygan, M., Heggernes, P. (eds.) IPEC 2014. LNCS, vol. 8894, pp. 110–121. Springer, Heidelberg (2014) Google Scholar
- 15.Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing - STOC 1978, pp. 216–226. ACM Press, New York, May 1978Google Scholar
- 16.Schwerdtfeger, K.W.: A Computational Trichotomy for Connectivity of Boolean Satisfiability, p. 24, December 2013. http://arxiv.org/abs/1312.4524
- 18.Veith, H.: How to encode a logical structure by an OBDD. In: Proceedings of the 13th IEEE Conference on Computational Complexity, pp. 122–131. IEEE Computer Society (1998)Google Scholar