On variable-weighted exact satisfiability problems

We show that the NP-hard optimization problems minimum and maximum weight exact satisfiability (XSAT) for a CNF formula C over n propositional variables equipped with arbitrary real-valued weights can be solved in O(||C||20.2441n) time. To the best of our knowledge, the algorithms presented here are the first handling weighted XSAT optimization versions in non-trivial worst case time. We also investigate the corresponding weighted counting problems, namely we show that the number of all minimum, resp. maximum, weight exact satisfiability solutions of an arbitrarily weighted formula can be determined in O(n2·||C|| + 20.40567n) time. In recent years only the unweighted counterparts of these problems have been studied (Dahllöf and Jonsson, An algorithm for counting maximum weighted independent sets and its applications. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 292–298, 2002; Dahllöf et al., Theor Comp Sci 320: 373–394, 2004; Porschen, On some weighted satisfiability and graph problems. In: Proceedings of the 31st Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2005). Lecture Notes in Comp. Science, vol. 3381, pp. 278–287. Springer, 2005).

[1]  Peter Jonsson,et al.  Algorithms for four variants of the exact satisfiability problem , 2004, Theor. Comput. Sci..

[2]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[3]  Stefan Porschen.  On Some Weighted Satisfiability and Graph Problems , 2005, SOFSEM.

[4]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Kurt Keutzer,et al.  A new viewpoint on code generation for directed acyclic graphs , 1998, TODE.

[7]  Jesper Makholm Byskov,et al.  New Algorithms for Exact Satisfiability , 2003 .

[8]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[9]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[10]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[11]  Laurent Simon,et al.  The Essentials of the SAT 2003 Competition , 2003, SAT.

[12]  Peter Jonsson,et al.  An algorithm for counting maximum weighted independent sets and its applications , 2002, SODA '02.

[13]  Stefan Porschen.  Solving Minimum Weight Exact Satisfiability in Time O(20.2441n) , 2005, ISAAC.

[14]  Stefan Porschen.  Counting All Solutions of Minimum Weight Exact Satisfiability , 2006, CIAC.

[15]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[16]  William J. Cook,et al.  Solving Large-Scale Matching Problems , 1991, Network Flows And Matching.

[17]  Alfred V. Aho,et al.  Code generation using tree matching and dynamic programming , 1989, ACM Trans. Program. Lang. Syst..

[18]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[19]  Stefan Porschen,et al.  Exact 3-satisfiability is decidable in time O(20.16254n) , 2005, Annals of Mathematics and Artificial Intelligence.

[20]  Armando Tacchella,et al.  Theory and Applications of Satisfiability Testing: 6th International Conference, Sat 2003, Santa Margherita Ligure, Italy, May 5-8 2003: Selected Revised Papers (Lecture Notes in Computer Science, 2919) , 2004 .

[21]  Stefan Porschen,et al.  Exact 3-Satisfiability Is Decidable in Time O (2 0.16254 n ) , 2005 .