Scribd
Upload
25 views

08 Exercise Solution

The document provides solutions to exercises on first-order logic. It defines predicates and constants for various statements and determines whether logic statements about a diagram of people loving each other are true or false.

Uploaded by

Yizreel Schwartz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
25 views

08 Exercise Solution

The document provides solutions to exercises on first-order logic. It defines predicates and constants for various statements and determines whether logic statements about a diagram of people loving each other are true or false.

Uploaded by

Yizreel Schwartz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

exercise_solution.

md 12/14/2021

Exercise assignment for the course Introduction to AI (Part I) in the Bachelor of AAI at Rosenheim University of
Applied Sciences

Assignment 08 - First-Order Logic


Task 1
a) In a propositional logic formula, what does each variable represent? In a first-order logic formula, what
does each variable represent?

Solution

In propositional logic, each variable (and formula) stands for a proposition, something that's either true or
false. In a first-order logic formula, each variable stands for an object.

b) What is the difference between a predicate and a function?

Solution

Predicates produce propositions as output, and functions produce objects as output.

Task 2
Define an appropriate language and formalize the following sentences using FOL formulas:

1. All Students are smart.


2. There exists a student.
3. There exists a smart student.
4. Every student loves some student.
5. Every student loves some other student.
6. There is a student who is loved by every other student.
7. Bill is a student.
8. Bill takes either Analysis or Geometry (but not both).
9. Bill takes Analysis and Geometry.
10. Bill doesn’t take Analysis.
11. No students love Bill.

Solution

1. ∀x.(Student(x) → Smart(x))
2. ∃x.Student(x)
3. ∃x.(Student(x) ∧ Smart(x))
4. ∀x.(Student(x) → ∃y.(Student(y) ∧ Loves(x, y)))
5. ∀x.(Student(x) → ∃y.(Student(y) ∧ ¬(x = y) ∧ Loves(x, y)))
6. ∃x.(Student(x) ∧ ∀y.(Student(y) ∧ ¬(x = y) → Loves(y, x)))
7. Student(Bill)
8. Takes(Bill, Analysis) ↔ ¬Takes(Bill, Geometry)
9. Takes(Bill, Analysis) ∧ Takes(Bill, Geometry)
10. ¬Takes(Bill, Analysis)
1/3
exercise_solution.md 12/14/2021

11. ¬∃x.(Student(x) ∧ Loves(x, Bill))

Task 3
Define an appropriate language and formalize the following sentences in FOL:

1. "A is above C, D is on E and above F."


2. "A is green while C is not."
3. "Everything is on something."
4. "Everything that is free has nothing on it."
5. "Everything that is green is free."
6. "There is something that is red and is not free."
7. "Everything that is not green and is above B, is red."

What are the constants?


What are the predicates?
Which axioms di exist?

Solution

Constants: A, B, C, D, E, F
Predicates: On2, Above2, F ree1, Red1, Green1.
Axioms
1. "A is above C, D is above F and on E." φ1 : Above(A, C) ∧ Above(E, F ) ∧ On(D, E)
2. "A is green while C is not." φ2 : Green(A) ∧ ¬Green(C)
3. "Everything is on something." φ3 : ∀x∃y.On(x, y)
4. "Everything that is free has nothing on it." φ4 : ∀x.(F ree(x) → ¬∃y.On(y, x))
5. "Everything that is green is free." φ5 : ∀x.(Green(x) → F ree(x))
6. "There is something that is red and is not free." φ6 : ∃x.(Red(x) ∧ ¬F ree(x))
7. "Everything that is not green and is above B, is red." φ7 : ∀x.(¬Green(x) ∧ Above(x, B) →
Red(x))

Task 4
The following diagram represents a set of people named A, B, C, and D. If there's an arrow from a person x
to a person y, then person x loves person y. We'll denote this by writing Loves(x, y). Below is a list of
formulas in first-order logic about the picture. In those formulas, the letter P represents the set of all the
people. For each formula, determine whether that formula is true or false.

2/3
exercise_solution.md 12/14/2021

a) ∀x ∈ P. ∀y ∈ P. (Loves(x, y) ∨ Loves(y, x))

This statement is false. Pick x and y to be A. Then Loves(x, y) is false and Loves(y, x) is false.
Remember that quantifiers can range over the same objects at the same time!

b) ∀x ∈ P. ∀y ∈ P. (x ≠ y → Loves(x, y) ∨ Loves(y, x))

This statement is true – given any pair of two people in this diagram, one of them loves the other.

c) ∀x ∈ P. ∀y ∈ P. (x ≠ y → (Loves(x, y) ↔ ¬Loves(y, x)))

This statement is true. Given any pair of two people, exactly one of them loves the other, so either
Loves(x, y) will be true, or Loves(y, x) will be true, but not both. The biconditional in this case will
therefore always evaluate to true.

d) ∃x ∈ P. ∀y ∈ P. (Loves(x, y))

This statement is false – no one loves everyone, because no one loves themselves.

e) ∃x ∈ P. ∀y ∈ P. (x ≠ y → Loves(x, y))

This statement is true – pick x to be person A.

f) ∀y ∈ P. ∃x ∈ P. (Loves(x, y))

This statement is false. No one loves person A.

g) ∀y ∈ P. ∃x ∈ P. (x ≠ y ∧ Loves(x, y))

This statement is still false – no one loves person A.

h) ∃x ∈ P. ∀y ∈ P. (¬Loves(x, y))

This statement is true – pick x to be person D.

3/3

You might also like