Consider the following information: Tony, Mike, and John belong to the Alpine

Club. Every member of the Alpine club who is not a skier is a mountain climber.

Mountain climbers do not like rain, and anyone who does not like snow is not a skier.

Mike dislikes whatever Tonty likes, and he likes whatever Tony dislikes. Tony likes rain

and snow.

Represent the information as a set of FOPL statements appropriate for backward

chaining. Show how an answer to the query $$Is there a member of the Alpine club who

is a mountain climber but not a skier?$$ is found by a backward chaining automated

deduction system by providing a $($consistent$)$ AND$/$OR solution tree that solves and

answer. Clearly show the rules and facts separately, and number them.

Some Suggested Ontology:

Member$($x$)$ x is member of Alpine club

Skier$($y$)$ y is a skier

Climber$($z$)$ z is a mountain climber

Likes$($x$,$y$)$ x likes y

$(20$ pts$)$ Consider the following information: Tony, Mike, and John belong to the Alpine

Club. Every member of the Alpine club who is not a skier is a mountain climber.

Mountain climbers do not like rain, and anyone who does not like snow is not a skier.

Mike dislikes whatever Tonty likes, and he likes whatever Tony dislikes. Tony likes rain

and snow.

Represent the information as a set of FOPL statements appropriate for backward

chaining. Show how an answer to the query $"$Is there a member of the Alpine club who

is a mountain climber but not a skier?" is found by a backward chaining automated

deduction system by providing a $($consistent$)$ AND$/$OR solution tree that solves and

answer. Clearly show the rules and facts separately, and number them.

Some Suggested Ontology: