5. A bottom-up proof procedure can incorporate an ask-the-user mechanism by asking the user about every askable
Question:
5. A bottom-up proof procedure can incorporate an ask-the-user mechanism by asking the user about every askable atom. How can a bottom-up proof procedure still guarantee proof of all (nonaskable)
atoms that are a logical consequence of a definite-clause knowledge base without asking the user about every askable atom?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Artificial Intelligence Foundations Of Computational Agents
ISBN: 9781107195394
2nd Edition
Authors: David L. Poole, Alan K. Mackworth
Question Posted: