Third edition of Artificial Intelligence: foundations of computational agents, Cambridge University Press, 2023 is now available (including the full text).
5.8 Review
The following are the main points you should have learned from this chapter:
- A definite clause knowledge base can be used to specify atomic clauses and rules about a domain when there is no uncertainty or ambiguity.
- Given a set of facts about a domain, the logical consequences characterize what else must be true.
- A sound and complete proof procedure can be used to determine the logical consequences of a knowledge base.
- Proof by contradiction can be used to make inference from a Horn clause knowledge base.
- Negation as failure can be used when the knowledge is complete (i.e., under the complete knowledge assumption).
- Abduction can be used to explain observations.
- A causal model predicts the effect of an intervention.
