×
+ All Categories
Log in
English
Français
Español
Deutsch
The top documents tagged [q yshow]
Home >
q yshow
1 Soundness and Completeness zKB |- S: S is provable from KB. zA proof procedure is sound if: yIf KB |- S, then KB |= S. yThat is, the procedure produces.
217 views