Approximate resolution of hard numbering problems

Conference · Tue Dec 31 04:00:00 EST 1996

OSTI ID:430651

Bailleux, O; Chabrier, J J ^[1]

---

1. CRID Universite de Bourgogne, Dijon (France)

We present a new method for estimating the number of solutions of constraint satisfaction problems. We use a stochastic forward checking algorithm for drawing a sample of paths from a search tree. With this sample, we compute two values related to the number of solutions of a CSP instance. First, an unbiased estimate, second, a lower bound with an arbitrary low error probability. We will describe applications to the Boolean Satisfiability problem and the Queens problem. We shall give some experimental results for these problems.

• OSTI ID: 430651
• Report Number(s): CONF-960876--
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
ARTIFICIAL INTELLIGENCE
DECISION TREE ANALYSIS
STATISTICAL MODELS