Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Consider the following formula in propositional logic. The knowledge base from (1) to (10) is given. 1. (~A => R)n(S => H) 2. A => (B UCUD) 3. E => (B UC UG) 4. (B UC UD) => A 5. (B UC UG) => E 6. Q => (G UC UH UP) 7. Q 8. -F 9. -A 10. E

Consider the following formula in propositional logic. The knowledge base from (1) to (10) is given. 1. (~A => R)n(S => H) 2. A => (B UCUD) 3. E => (B UC UG) 4. (B UC UD) => A 5. (B UC UG) => E 6. Q => (G UC UH UP) 7. Q 8. -F 9. -A 10. E

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

Answer all 3 parts

Consider the following formula in propositional logic. The knowledge base from (1) to (10) is given. 1. (~A => R)n(S => H) 2. A => (B U CUD) 3. E => (B UCUG) 4. (B UC UD) => A 5. (B UC UG) => E 6. Q => (G UCUHUP) 7. Q 8. -F 9. -A 10. E (1). Converting the above to Conjunctive Normal Form. (2). From the result of (1), prove G by using reference rules as Method 1 of the lecture note. Write the process of the proof with the corresponding number of rules and facts. (3) From the result of (1), prove KB = G by contradiction as to show KB A- G is unsatifiable as Method 2 of the lecture note. Write the process of the proof with the corresponding number of rules and facts. You should start with - G for this process.
Transcribed Image Text:Consider the following formula in propositional logic. The knowledge base from (1) to (10) is given. 1. (~A => R)n(S => H) 2. A => (B U CUD) 3. E => (B UCUG) 4. (B UC UD) => A 5. (B UC UG) => E 6. Q => (G UCUHUP) 7. Q 8. -F 9. -A 10. E (1). Converting the above to Conjunctive Normal Form. (2). From the result of (1), prove G by using reference rules as Method 1 of the lecture note. Write the process of the proof with the corresponding number of rules and facts. (3) From the result of (1), prove KB = G by contradiction as to show KB A- G is unsatifiable as Method 2 of the lecture note. Write the process of the proof with the corresponding number of rules and facts. You should start with - G for this process.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Predicate
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.
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
SEE MORE TEXTBOOKS