Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is an ontology of inference methods by completeness?

  • A.Completeness and soundness are two names for the same property
  • B.Complete methods prove absence, incomplete ones only find solutions
  • C.Complete methods are always faster than incomplete ones in practice
  • D.Incomplete methods are unsound and may return wrong answers

Answer: B

Systematic search with propagation can exhaust the space and prove no solution exists, while local search samples and can only succeed or give up. Incomplete methods are generally sound: what they find is genuinely a solution. Speed varies by instance and completeness is quite distinct from soundness. Classifying a method by what may be concluded from its failure, rather than by its success rate, is what decides whether it suits a verification task.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.