ition symbol,
    one for each clause, and one for the conjunction of clauses.)<br />

2.  The problem of counting the number of satisfying assignments for a
    3-SAT problem is \#P-complete. Show that exact inference is at least
    as hard as this.<br />
</div>

  </div>
  <div class="card">
    <div class="card-header p-2">
        <a href='#' class="p-2">Exercise 14.19</a>
        <a class="bookmarkquest" id="bookmark_question">
          <button type="button" class="btn btn-dark float-right" title="Bo