Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

First-Order Logic : girl is cute, some boys will love her . If a girl is poor, no boys will love her. Assume that you

First-Order Logic :

girl is cute, some boys will love her . If a girl is poor, no boys will love her.

Assume that you are given the following predicates:

Girl(X) X is a girl.

Boy(X) X is a boy.

Poor(X)Xispoor.

Cute(X) X is cute.

Loves(X,Y)X will love.

(a) (8 pts) Translate the two statements above into first-order logic using these predicates.

(b) (15 pts) Prove using resolution by refutation that All poor girls are not cute. Show any unifiers required for the resolution. Be sure to provide a clear numbering of the sentences in the knowledge base and indicate which sentences are involved in each step of the proof.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Larry Ellison Database Genius Of Oracle

Authors: Craig Peters

1st Edition

0766019748, 978-0766019744

More Books

Students also viewed these Databases questions