AI · Theory

First-Order Logic

Theory

35/215

First-Order Logic

FOL adds objects, predicates, functions, and quantifiers ∀ ∃. Student(Asha). ∀x Student(x) → Human(x). You can talk about “every pit” without a new letter per square. Richer than propositional logic, harder to compute.

Trap — mixing up ∀ and ∃. “There exists a safe square” is not “all squares are safe”.

Output — idea / do / check for First-Order Logic. Fill those three in the viva.

Exam tip

One ∀ sentence + one ∃ sentence.

Example

# First-Order Logic
print("idea :", "First-Order Logic")
print("do   : one tiny example on paper")
print("check: one failure case")

Output: idea / do / check for First-Order Logic. Fill those three in the viva.

Short notes

DefObjects + predicates + ∀ ∃.
RuleRicher than PL, slower.

AI · Theory

First-Order Logic

← All stacks

Theory

35/215

First-Order Logic

Trap — mixing up ∀ and ∃. “There exists a safe square” is not “all squares are safe”.

Output — idea / do / check for First-Order Logic. Fill those three in the viva.

Exam tip

One ∀ sentence + one ∃ sentence.

Example

# First-Order Logic
print("idea :", "First-Order Logic")
print("do   : one tiny example on paper")
print("check: one failure case")

Output: idea / do / check for First-Order Logic. Fill those three in the viva.

Short notes

DefObjects + predicates + ∀ ∃.
RuleRicher than PL, slower.

First-Order Logic

Example

Short notes

Questions

First-Order Logic

Example

Short notes

Questions