• Keine Ergebnisse gefunden

ExerciseSheet8–Circumscription,inferencerelations NonmonotonicReasoning

N/A
N/A
Protected

Academic year: 2022

Aktie "ExerciseSheet8–Circumscription,inferencerelations NonmonotonicReasoning"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

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

Nonmonotonic Reasoning

Winter Semester 2017/18 Exercise Sheet 8 – Circumscription, inference relations 10th January 2018 Dr. (habil.) Anni-Yasmin Turhan

Exercise 8.1 Defineϕ[p11, . . . ,pnn], the simultaneous substitution of the predicates in pi by the predicate expressionsψiinϕ.

Exercise 8.2 Consider the circumscription schema forisBlockand the given formula

isBlock(a)∧isBlock(b).

Explain what happens when . . .

(a) . . . the predicate expressionψ(X)≡X=ais used.

(b) . . . the predicate expressionψ(X)≡(X=a∨X=b∨X=c)is used.1 (c) . . .isBlock(c)is added to the given knowledge.

Exercise 8.3 The propertyReciprocityholds for an inference operationCiff:

M⊆C(N)andN⊆C(M)impliesC(M) =C(N).

Prove or refute the following claim: LetCbe an inference operation that satisfies Inclusion.

ThenCsatisfies Cumulativity iffCsatisfies Reciprocity.

1An earlier version of the exercise sheet hadinstead of, unfortunately.

1

Referenzen

ÄHNLICHE DOKUMENTE

An inference relation that satisfies Inclusion, Idempotence, Cut, Cautious Monotony and Cumulativity is called a cumulative inference relation.... Relationship between

Faculty of Computer Science Institute of Theoretical Computer Science, Chair of Automata Theory.. Nonmonotonic Reasoning Winter

Nonmonotonic Reasoning Winter Semester 2017/18. Exercise Sheet 2 26th

Faculty of Computer Science Institute of Theoretical Computer Science, Chair of Automata Theory. Nonmonotonic Reasoning Winter

Exercise 4.4 A class C is called representationally complete iff the following property is satisfied: For every default theory T there is a default theory T 0 in C such that T and T

Exercise 5.2 Devise a default theory with three extensions and compute all brave and all cautious consequences (modulo equivalence) of it. Exercise 5.3 Express some of the examples

Nonmonotonic Reasoning Winter Semester 2017/18 Exercise Sheet 6 – Autoepistemic logics 13th December 2017 Dr. (habil.)

Faculty of Computer Science Institute of Theoretical Computer Science, Chair of Automata Theory.. Nonmonotonic Reasoning Winter Semester 2017/18 Exercise Sheet 10