AI · Theory

Rules of Inference

Theory

32/215

Rules of Inference

Inference rules let you derive new sentences. Modus ponens: from P and P→Q infer Q. And-elimination, resolution, etc. Sound rules never invent falsehoods from true premises. Complete methods find every entailed sentence (in the fragment they cover).

Board — “If dirt then suck. Dirt is true.” Infer suck. That is modus ponens, not magic.

Output — idea / do / check for Rules of Inference. Fill those three in the viva.

Exam tip

Modus ponens with one AI action.

Example

# Rules of Inference
print("idea :", "Rules of Inference")
print("do   : one tiny example on paper")
print("check: one failure case")

Output: idea / do / check for Rules of Inference. Fill those three in the viva.

Short notes

DefModus ponens: P, P→Q ⊢ Q.
RuleSound vs complete.

AI · Theory

Rules of Inference

← All stacks

Theory

32/215

Rules of Inference

Board — “If dirt then suck. Dirt is true.” Infer suck. That is modus ponens, not magic.

Output — idea / do / check for Rules of Inference. Fill those three in the viva.

Exam tip

Modus ponens with one AI action.

Example

# Rules of Inference
print("idea :", "Rules of Inference")
print("do   : one tiny example on paper")
print("check: one failure case")

Output: idea / do / check for Rules of Inference. Fill those three in the viva.

Short notes

DefModus ponens: P, P→Q ⊢ Q.
RuleSound vs complete.

Rules of Inference

Example

Short notes

Questions

Rules of Inference

Example

Short notes

Questions