As a reminder, we probabilistically test for entailment by computing the probability of the query given the text, or, more precisely, P(H|T, KB, W T,H ).
samplesearch is an importance sampling algorithm that has been shown to be effective when there is a mix of probabilistic and deterministic (hard) constraints, a fundamental property of the inference problems we address.