• Keine Ergebnisse gefunden

SS 2012 30.5.2012 Exercises to the lecture Logics Sheet 4 Jun.-Prof. Dr. Roland Meyer Due 12.6.2012 12:00 Uhr Exercise 4.1 [Resolution Calculus] a) Let K

N/A
N/A
Protected

Academic year: 2021

Aktie "SS 2012 30.5.2012 Exercises to the lecture Logics Sheet 4 Jun.-Prof. Dr. Roland Meyer Due 12.6.2012 12:00 Uhr Exercise 4.1 [Resolution Calculus] a) Let K"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

SS 2012 30.5.2012 Exercises to the lecture Logics

Sheet 4

Jun.-Prof. Dr. Roland Meyer Due 12.6.2012 12:00 Uhr

Exercise 4.1 [Resolution Calculus]

a) Let K

1

, K

2

be clauses and I be a literal with I P K

1

and I P K

2

. Show that t K

1

, K

2

u ( Res

I

p K

1

, K

2

q .

b) Prove the correctness of the resolution calculus, i.e. show that for any formula F and any clause K with F $

Res

K, we have F ( K.

c) Using the Resolution Calculus, show that ppp p Ñ q q ^ p q Ñ r qq Ñ p r ^ p qq is a tautology.

Exercise 4.2 [Dual Formulae]

a) Calculate d p pp p ^ q q _ p r ^ s qqq step-by-step according to Definition 2.19.

b) For each valuation ϕ, let ϕ

1

defined by ϕ

1

p p q 1 ϕ p p q for each variable p. Show that for any formula A, we have ϕ

1

p d p A qq 1 ϕ p A q .

c) Deduce from b) that for any formula A, the following holds: A is a tautology if and only if d p A q is unsatisfiable.

Exercise 4.3 [Negation Normal Form]

Using structural induction, prove that for any formula there is an equivalent formula in negation normal form. Hint: In order to make the induction work, show by induction that A as well as A has a negation normal form.

Exercise 4.4 [Tableaux]

Let Σ be a set of formulas and p, q be atomic formulae with Σ $

τ

p and Σ $

τ

p Ñ q.

Prove that then Σ $

τ

q.

Delivery: until 12.6.2012 12:00 Uhr into the box next to room 34/401.4

Referenzen

ÄHNLICHE DOKUMENTE

A set M is called recursively enumerable, if there is an algorithm that outputs a (possibly infinite) sequence in which each element occurs if and only if it is contained in M.

Mai 2012 In-class Exercises to the Lecture Logics.

[r]

[r]

Smullyan’s ball game is played by one player according to the following rules: There is a container that has capacity for an unlimited number of balls.. Furthermore, there is

[r]

[r]

in einer Datenbank) modelliert wer- den können. Es soll dabei die Möglichkeit bestehen, dass zu gewissen Personen nur ein Teil der Angaben vorliegen. Spezifizieren Sie