New Worst-Case upper Bound for Counting Exact Satisfiability

The counting exact satisfiablity problem (#XSAT) is a problem that computes the number of truth assignments satisfying only one literal in each clause. This paper presents an algorithm that solves the #XSAT problem in O(1.1995n), which is faster than the best algorithm running in O(1.2190n), where n denotes the number of variables. To increase the efficiency of the algorithm, a new principle, called common literals principle, is addressed to simplify formulae. This allows us to further eliminate literals. In addition, we firstly apply the resolution principles into solving #XSAT problem, and therefore it improves the efficiency of the algorithm further.

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

[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]  Wei Li,et al.  Many hard examples in exact phase transitions , 2003, Theor. Comput. Sci..

[5]  Bolette Ammitzbøll Jurik,et al.  New algorithms for Exact Satisfiability , 2003, Theor. Comput. Sci..

[6]  Henry A. Kautz,et al.  Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.

[7]  James D. Park,et al.  MAP Complexity Results and Approximation Methods , 2002, UAI.

[8]  A. S. Kulikov.  An upper bound O(20.16254n) for exact 3-satisfiability: a simpler proof , 2005 .

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

[10]  Ke Xu,et al.  A tighter upper bound for random MAX 2-SAT , 2011, Inf. Process. Lett..

[11]  Kazuhisa Makino,et al.  Derandomizing the HSSW Algorithm for 3-SAT , 2012, Algorithmica.

[12]  Wei Li,et al.  Exact Phase Transitions in Random Constraint Satisfaction Problems , 2000, J. Artif. Intell. Res..

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

[14]  Hongtao Sun,et al.  Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model , 2007, TAMC.

[15]  Ke Xu,et al.  Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..

[16]  Tian Liu,et al.  On Exponential Time Lower Bound of Knapsack under Backtracking , 2010, Theor. Comput. Sci..