Scribd
Upload
110 views

Fuzzy Description Logic

This document appears to be an exercise sheet for a course on fuzzy logic. It contains 8 exercises exploring properties of fuzzy logic operators like t-norms, residuums, precomplements, and t-conorms. It asks students to prove characteristics of these operators, find minimum and maximum examples, determine which are idempotent or nilpotent, and identify which logical formulas are tautologies under different fuzzy logics. The final exercise asks students to find a formula that is satisfiable in one fuzzy logic but does not have a witnessed model.

Uploaded by

Parham
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
110 views

Fuzzy Description Logic

This document appears to be an exercise sheet for a course on fuzzy logic. It contains 8 exercises exploring properties of fuzzy logic operators like t-norms, residuums, precomplements, and t-conorms. It asks students to prove characteristics of these operators, find minimum and maximum examples, determine which are idempotent or nilpotent, and identify which logical formulas are tautologies under different fuzzy logics. The final exercise asks students to find a formula that is satisfiable in one fuzzy logic but does not have a witnessed model.

Uploaded by

Parham
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Faculty of Computer Science Institute of Theoretical Computer Science, Chair of Automata Theory

Fuzzy Description Logic Winter Semester 2018/19

Exercise Sheet 1 – Fuzzy Logic


Dr.-Ing. Stefan Borgwardt

Exercise 1.1 For all X ∈ {G, Π, Ł}, show that ⊗X is actually a t-norm, and that ⇒X, X, ⊕X are the
residuum, precomplement, and t-conorm, respectively, of ⊗X.

Exercise 1.2 Prove the following:

(a) Every t-norm ⊗ is compatible with classical conjunction on {0, 1}, i.e.
(0 ⊗ 0) = (1 ⊗ 0) = (0 ⊗ 1) = 0 and (1 ⊗ 1) = 1.

(b) For every continuous t-norm ⊗, the residuum ⇒, precomplement , and t-conorm ⊕ are
compatible with classical implication, negation, and disjunction, respectively, on {0, 1}.

(c) All t-norms agree on the “border region” of [0, 1] × [0, 1], i.e. for any two t-norms ⊗, ⊗0 and
values x, y ∈ [0, 1] where either x ∈ {0, 1} or y ∈ {0, 1}, we have x ⊗ y = x ⊗0 y.

Exercise 1.3 A partial order on the set of all t-norms can be defined by comparing t-norms ⊗1, ⊗2
point-wise: We write ⊗1 ≤ ⊗2 if, for all x, y ∈ [0, 1], we have x ⊗1 y ≤ x ⊗2 y.

(a) Find two t-norms ⊗min and ⊗max such that every t-norm ⊗ satisfies ⊗min ≤ ⊗ ≤ ⊗max.

(b) Are there continuous t-norms ⊗min and ⊗max such that every continuous t-norm ⊗ satisfies
⊗min ≤ ⊗ ≤ ⊗max?

Exercise 1.4 For a t-norm ⊗, an element x ∈ [0, 1] is idempotent if x ⊗ x = x.

(a) What are the idempotent elements of the three basic t-norms?

(b) What are the idempotent elements of an ordinal sum?

(c) Prove: If all x ∈ [0, 1] are idempotent, then ⊗ is the Gödel t-norm.

Exercise 1.5 For a t-norm ⊗, an element x ∈ (0, 1] is nilpotent if there exists y ∈ (0, 1] such that
x ⊗ y = 0.

(a) What are the nilpotent elements of the three basic t-norms?

(b) What are the nilpotent elements of an ordinal sum?

i∈I (⊗i , ai , bi ) with ⊗i = ⊗Ł and ai = 0 for some i ∈ I, what is the


P
(c) Given an ordinal sum
precomplement of this ordinal sum?

(d) Given a t-norm without nilpotent elements, what is its precomplement?

1
Exercise 1.6 For which X ∈ {G, Π, Ł, Z} are the following propositional formulas X-tautologies?

(a) (p ∧ q) → p

(b) p ∨ ¬p

(c) p → ¬¬p

(d) ¬¬p → p

(e) p → (q → p)

(f) p → (p → (p ∧ p))

Exercise 1.7 Prove the following: If φ is a tautology in a fuzzy propositional logic, then it is also a
tautology in classical propositional logic.

Exercise 1.8 Find a fuzzy first-order formula that is Π-satisfiable, but does not have a witnessed
Π-model.
Hint. Under Π-semantics, x = 1 is equivalent to x = 0, x = 1 is equivalent to x > 0, and
x ⊗ x = x2 < x.

You might also like