## Abstract

The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the probabilities in Bayes networks is a problem which has been studied for a while, and may well provide a good approximation to counting the number of solutions. We use a simple approximation based on independence, and show that it is correct for tree-structured CSPs. For other CSPs, it is a less optimistic approximation than those suggested in prior work, and experiments show that it is more accurate on the average. We present empirical evidence that our approximation is a useful search heuristic for finding a single solution to a CSP.

Original language | English |
---|---|

Pages | 179-184 |

Number of pages | 6 |

State | Published - 1997 |

Externally published | Yes |

Event | Proceedings of the 1997 14th National Conference on Artificial Intelligence, AAAI 97 - Providence, RI, USA Duration: 27 Jul 1997 → 31 Jul 1997 |

### Conference

Conference | Proceedings of the 1997 14th National Conference on Artificial Intelligence, AAAI 97 |
---|---|

City | Providence, RI, USA |

Period | 27/07/97 → 31/07/97 |