Quiz 5

Question 1

___________________ are statements that are assumed to be true and from which all true statements about natural numbers can be proved.

Predicates
Axioms
Quantifiers
Connectives

Answer 1

Axioms

Question 2

T/F
“A or B -> C” is in the form of a Horn Clause.

Answer 2

False

Question 3

How can you write the fact “A parrot is a bird” in predicate calculus?

parrot(bird).
parrot(x,bird).
bird(parrot).
bird -> parrot

Answer 3

bird(parrot).

Question 4

T/F
Logic programming is based on lambda calculus.

Answer 4

False

Question 5

a -> d

c -> b

d -> c

Using the statements above, which of the following statement can be derived using inference rules.

d -> a
a -> b
c -> a
b -> d

Answer 5

a -> b