snippetModerate
Example of Soundness & Completeness of Inference
Viewed 0 times
completenessexampleinferencesoundness
Problem
Is the following example correct about whether an inference algorithm is sound and complete?
Suppose we have needles a, b, c in a haystack, and have also an inference algorithm that is designed to find needles.
-
sound - Only needles a, b and c are obtained.
-
complete - Needles a, b and c are obtained. Other hay may also be obtained.
Suppose we have needles a, b, c in a haystack, and have also an inference algorithm that is designed to find needles.
-
sound - Only needles a, b and c are obtained.
-
complete - Needles a, b and c are obtained. Other hay may also be obtained.
Solution
You have almost got it right, but your definition of soundness is not quite right, or perhaps too subtle.
I would say that the inference algorithm is sound if everything returned is a needle (hence some needles may be missed) and complete if all needles are returned (hence some hay may be returned too).
I would say that the inference algorithm is sound if everything returned is a needle (hence some needles may be missed) and complete if all needles are returned (hence some hay may be returned too).
Context
StackExchange Computer Science Q#1609, answer score: 11
Revisions (0)
No revisions yet.