• Keine Ergebnisse gefunden

SS 2012 11.07.2012 Exercises to the lecture Logics Sheet 7 Jun.-Prof. Dr. Roland Meyer Due 24.07.2012 12:00 Uhr

N/A
N/A
Protected

Academic year: 2021

Aktie "SS 2012 11.07.2012 Exercises to the lecture Logics Sheet 7 Jun.-Prof. Dr. Roland Meyer Due 24.07.2012 12:00 Uhr"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

SS 2012 11.07.2012 Exercises to the lecture Logics

Sheet 7

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

Please note: The points on this sheet are not counted towards the 100% of which you need at least 60%.

Achtung: Die Punkte auf diesem Blatt zählen nicht zu den 100%, von denen mindestens 60% erreicht werden müssen.

Exercise 7.1 [Resolution]

Using resolution, show that the formula

@ z

1

r q p z

1

qs _ @ x rp q p x q _ r p x qq ^ D z

2

r p p z

2

q ^ p p p z

2

q _ r p x qqss is a tautology. This amounts to

a) negating the formula,

b) bringing the result into clause form, and

c) applying resolution to the formula in clause form.

Exercise 7.2 [Calculating MGU]

For each of the following sets of literals, decide whether it is unifiable and if so, determine an MGU.

a) t q p x, z q , q p h p y, z q , f p a qq , q p h p f p b q , z q , z qu . b) t p p x, f p y qq , p p f p a q , y qu .

Exercise 7.3 [Equality in predicate logic]

Show that for each formula A in predicate logic, we can construct a formula A

1

that does not contain “=” and is equisatisfiable to A. (Formulae A and B are called equisatisfiable if A is satisfiable if and only if B is satisfiable.)

Exercise 7.4 [An application to graphs]

By a graph, we mean an undirected (not necessarily finite) graph that may have loops. The length of a path is the number of edges in the path. The distance between two vertices is the length of a shortest path between them. We call a vertex isolated if there is no other vertex to which it is connected by an edge.

a) Formalize the following statement as a formula in first order predicate logic: If for each pair of vertices, their distance is at most 2 and there are at least two distinct vertices, then there is no isolated vertex.

b) Negate the formula and transform the result into an equisatisfiable formula without

“=”.

c) Using resolution, show that the obtained formula is unsatisfiable.

Delivery: until 24.07.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]

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]

such that you can define sets of graphs using formulae... b) Present a formula that defines precisely the set of connected graphs. Exercise

Note: Hence, you have shown that completeness means that the theory cannot be extended consistently in two ways that contradict each other. Exercise 6.4