Q9: Knowledge Representation Consider the following statements: 1. All children have a favourite toy. 2. Whoever likes dolls or soft toys is a child. 3. Fuzzy is a soft toy: SOFT-TOY (Fuzzy). 4. Ellen likes Fuzzy: LIKES (Ellen, Fuzzy). (a) Using only the following predicates CHILD(*), HAS-FAV-TOY(*), LIKES (*,*), DOLL(*) and SOFT-TOY(*), represent the two statements as predicate calculus well formed formulas (Wffs) Notes: The asterisks indicate the number of arguments in each predicate; keep your representation consistent with the predicates in statements 3 and 4 above.) (b) Convert these statements into clauses. (c) Use resolution refutation to prove that Ellen has a favourite toy. state the goal, and indicate clearly the number of the clause you are using, and any substitutions you make. Goal 5: HAS-FAV-TOY (Ellen). Negated goal: -HAS-FAV-TOY(Ellen).

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Q9: Knowledge Representation - Consider the following statements:
1. All children have a favourite toy.
2. Whoever likes dolls or soft toys is a child.
3. Fuzzy is a soft toy: SOFT-TOY (Fuzzy).
4. Ellen likes Fuzzy: LIKES (Ellen, Fuzzy).
(a) Using only the following predicates CHILD(*), HAS-FAV-TOY(*), LIKES (*,*), DOLL(*) and SOFT-TOY(*), represent the two statements as predicate calculus well formed formulas (wffs).
Notes: The asterisks indicate the number of arguments in each predicate; keep your representation consistent with the predicates in statements 3 and 4 above.)
(b) Convert these statements into clauses.
(c) Use resolution refutation to prove that Ellen has a favourite toy. State the goal, and indicate clearly the number of the clause you are using, and any substitutions you make.
Goal 5: HAS-FAV-TOY(Ellen). Negated goal: ¬HAS-FAV-TOY(Ellen).
Transcribed Image Text:Q9: Knowledge Representation - Consider the following statements: 1. All children have a favourite toy. 2. Whoever likes dolls or soft toys is a child. 3. Fuzzy is a soft toy: SOFT-TOY (Fuzzy). 4. Ellen likes Fuzzy: LIKES (Ellen, Fuzzy). (a) Using only the following predicates CHILD(*), HAS-FAV-TOY(*), LIKES (*,*), DOLL(*) and SOFT-TOY(*), represent the two statements as predicate calculus well formed formulas (wffs). Notes: The asterisks indicate the number of arguments in each predicate; keep your representation consistent with the predicates in statements 3 and 4 above.) (b) Convert these statements into clauses. (c) Use resolution refutation to prove that Ellen has a favourite toy. State the goal, and indicate clearly the number of the clause you are using, and any substitutions you make. Goal 5: HAS-FAV-TOY(Ellen). Negated goal: ¬HAS-FAV-TOY(Ellen).
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Inference
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education