Abstract
Splitting a variable in a Boolean formula means to replace an arbitrary set of its occurrences by a new variable. In the minimum splitting SAT problem, we ask for a minimum-size set of variables to be split in order to make the formula satisfiable. This problem is known to be APX-hard, even for 2-CNF formulas. We consider the case of 2-CNF Horn formulas, i.e., 2-CNF formulas without positive 2-clauses, and prove that this problem is APX-hard as well. We also analyze subcases of 2-CNF Horn formulas, where additional clause types are forbidden. While excluding negative 2-clauses admits a polynomial-time algorithm based on network flows, the splitting problem stays APX-hard for formulas consisting of positive 1-clauses and negative 2-clauses only.
Instead of splitting as many variables as possible to make a formula satisfiable, one can also look at the dual problem of finding the maximum number of variables that can be assigned without violating a clause. We also study the approximability of this maximum assignment problem on 2-CNF Horn formulas. While the polynomially solvable subproblems are the same as for the splitting problem, the maximum assignment problem in general Horn formulas is as hard to approximate as the maximum independent set problem.
This work was partially supported by SNF grant 200021/132510.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer (1999)
Boppana, R., Halldórsson, M.: Approximating maximum independent sets by excluding subgraphs. BIT Numerical Mathematics 32, 180–196 (1992)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)
Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming 1(3), 267–284 (1984)
Håstad, J.: Clique is hard to approximate within n 1 − ε. In: FOCS 1996: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, p. 627. IEEE Computer Society (1996)
Hromkovič, J.: Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Texts in Theoretical Computer Science. An EATCS Series. Springer (2003)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. Journal of Computer and System Sciences 74(3), 335–349 (2008)
Monien, B., Speckenmeyer, E.: Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Informatica 22, 115–123 (1985)
Ono, H.: Personal communication
Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43(3), 425–440 (1991)
Steinová, M.: Measuring Hardness of Complex Problems: Approximability and Exact Algorithms. PhD thesis, ETH Zurich (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Böckenhauer, HJ., Keller, L. (2013). On the Approximability of Splitting-SAT in 2-CNF Horn Formulas. In: Lecroq, T., Mouchard, L. (eds) Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45278-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-45278-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45277-2
Online ISBN: 978-3-642-45278-9
eBook Packages: Computer ScienceComputer Science (R0)