Quiz 5

Question 1

Logic programming is based on lambda calculus, T/F?

Answer 1

False

Question 2

How can you write the fact “A parrot is a bird” in predicate calculus?
parrot(bird), bird(parrot), parrot(x,bird), or bird -> parrot?

Answer 2

bird(parrot)

Question 3

a -> d
c -> b
d -> c
Using the statements above, which of the following statement can be derived using inference rules?
b -> d, a -> b, d -> a, c -> a

Answer 3

a -> b

Question 4

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

Answer 4

False

Question 5

________ are statements that are assumed to be true and from which all true statements about natural numbers can be proved.
Predicates, quantifiers, connectives, or axioms?

Answer 5

Axioms