Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

If you copied from. Any sources I will put 10 downvotes if you don't know just skip the question.... Economic... 1.2 $$ begin{array}{1} begin{array}{1} text

If you copied from. Any sources I will put 10 downvotes if you don't know just skip the question.... Economic... 1.2

image text in transcribed

$$ \begin{array}{1} \begin{array}{1} \text { Question #1 } \\ \text { For a rule-based system with the following contents prove the goal: } eg \mathrm{DATE} (\text { Mary, John }) \text { using the backward chaining: Draw the complete AND-OR Graph. } \\ \text { Rules: } \\ \text { 1. }(\mathrm{HARLEY} (\mathrm{y}) \wedge \mathrm{RIDES) (\mathrm{x}, \mathrm{y})) ightarrow \mathrm{ROUGH}(\mathrm{x}) \\ \text { 2. } \operatorname{BIKER (\mathrm{x}) ightarrow (\mathrm{HARLEY) (\mathrm{y}) \vee \mathrm{BMW} (\mathrm{y})) \\ \text { 3. } \operatorname {BIKER) (\mathrm{x}) ightarrow \operatorname{RIDES}(\mathrm{x}, \mathrm{y})) \text { 4. }(\mathrm{RIDES) (\mathrm{x}, \mathrm{y}) \wedge \mathrm{BMW} (\mathrm{y}) ightarrow \text { YUPPIE }(\mathrm{x})) ! \text { 5. YUPPIE }(\mathrm{x}) ightarrow \operatorname{LAWYER) (\mathrm{x}) \text { 6. }(\mathrm{NICE} (\mathrm{x}) \wedge \mathrm{ROUGH} (\mathrm{y})) ightarrow eg \mathrm{DATE) (\mathrm{x}, \mathrm{y}) \text { 7. }(\mathrm{LAWYER) (\mathrm{x}) \wedge eg \mathrm{NICE) (\mathrm{y})) ightarrow eg \mathrm{DATE}(\mathrm{x}, \mathrm{y}) \end{array}\\ \text { Facts: } \end{array} $$ $$ \begin{array}{1} \begin{array}{1} \text { Question #1 } \\ \text { For a rule-based system with the following contents prove the goal: } eg \mathrm{DATE} (\text { Mary, John }) \text { using the backward chaining: Draw the complete AND-OR Graph. } \\ \text { Rules: } \\ \text { 1. }(\mathrm{HARLEY} (\mathrm{y}) \wedge \mathrm{RIDES) (\mathrm{x}, \mathrm{y})) ightarrow \mathrm{ROUGH}(\mathrm{x}) \\ \text { 2. } \operatorname{BIKER (\mathrm{x}) ightarrow (\mathrm{HARLEY) (\mathrm{y}) \vee \mathrm{BMW} (\mathrm{y})) \\ \text { 3. } \operatorname {BIKER) (\mathrm{x}) ightarrow \operatorname{RIDES}(\mathrm{x}, \mathrm{y})) \text { 4. }(\mathrm{RIDES) (\mathrm{x}, \mathrm{y}) \wedge \mathrm{BMW} (\mathrm{y}) ightarrow \text { YUPPIE }(\mathrm{x})) ! \text { 5. YUPPIE }(\mathrm{x}) ightarrow \operatorname{LAWYER) (\mathrm{x}) \text { 6. }(\mathrm{NICE} (\mathrm{x}) \wedge \mathrm{ROUGH} (\mathrm{y})) ightarrow eg \mathrm{DATE) (\mathrm{x}, \mathrm{y}) \text { 7. }(\mathrm{LAWYER) (\mathrm{x}) \wedge eg \mathrm{NICE) (\mathrm{y})) ightarrow eg \mathrm{DATE}(\mathrm{x}, \mathrm{y}) \end{array}\\ \text { Facts: } \end{array} $$

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_2

Step: 3

blur-text-image_3

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

Spomenik Monument Database

Authors: Donald Niebyl, FUEL, Damon Murray, Stephen Sorrell

1st Edition

0995745536, 978-0995745537

More Books

Students also viewed these Databases questions