Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems

Counting the number of solutions to CSP instances has vast applications in several areas ranging from statistical physics to artificial intelligence. We provide a new algorithm for counting the number of solutions to binary Csp s which has a time complexity ranging from O((d/4·α4)n) to O((α+α5+[d/4-1]·α4)n) (where α ≈ 1.2561) depending on the domain size d ≥ 3. This is substantially faster than previous algorithms, especially for small d. We also provide an algorithm for counting k-colourings in graphs and its running time ranges from O([log2k]n) to O([log2k+1]n) depending on k ≥ 4. Previously, only an O(1.8171n) time algorithm for counting 3-colourings were known, and we improve this upper bound to O(1.7879n).

[1]  Justin Pearson,et al.  Constraints and universal algebra , 1998, Annals of Mathematics and Artificial Intelligence.

[2]  Roberto J. Bayardo,et al.  Counting Models Using Connected Components , 2000, AAAI/IAAI.

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

[4]  T. K. Satish Kumar,et al.  A Model Counting Characterization of Diagnoses , 2002 .

[5]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[6]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[7]  Ola Angelsmark,et al.  Determining the Number of Solutions to Binary CSP Instances , 2002, CP.

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

[9]  Oliver Kullmann,et al.  New Methods for 3-SAT Decision and Worst-case Analysis , 1999, Theor. Comput. Sci..

[10]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.

[11]  Olivier Dubois,et al.  Counting the Number of Solutions for Instances of Satisfiability , 1991, Theor. Comput. Sci..

[12]  Magnus Wahlström,et al.  Counting Satisfying Assignments in 2-SAT and 3-SAT , 2002, COCOON.

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

[14]  Philippe Jégou.  Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems , 1993, AAAI.

[15]  Catherine S. Greenhill,et al.  The complexity of counting graph homomorphisms , 2000 .

[16]  Nadia Creignou,et al.  Complexity of Generalized Satisfiability Counting Problems , 1996, Inf. Comput..

[17]  Richard Beigel,et al.  Finding maximum independent sets in sparse and general graphs , 1999, SODA '99.

[18]  Adnan Darwiche,et al.  On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision , 2001, J. Appl. Non Class. Logics.

[19]  Nicolas Barnier,et al.  Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .