In this paper we study NP-hard variable-weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds holding for arbitrary real-valued weights. Moreover, we consider the monotone dual class consisting of clause sets where all variables occur at most twice. We show that weighted SAT, XSAT and NAESAT optimization problems for this class are polynomial time solvable using appropriate reductions to specific polynomial time solvable graph problems. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Porschen, S., & Speckenmeyer, E. (2007). Algorithms for variable-weighted 2-SAT and dual problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4501 LNCS, pp. 173–186). Springer Verlag. https://doi.org/10.1007/978-3-540-72788-0_19
Mendeley helps you to discover research relevant for your work.