Convert statement into conjunctive normal form , Computer Engineering

Assignment Help:

Consider the following statements about the types of fruit people like.

If people like apples, then they do not like oranges. If people do not like apples, then they like oranges and grapes. If people do not like oranges or they like grapes, then they like pears. If people like pears, then they like bananas.

a. Express the above statements in propositional logic. Clearly define the meaning of your propositional symbols.

b. Convert your statements from (a) into conjunctive normal form (CNF). Number the clauses in your knowledge base (KB) starting with number 1.

c. Using proof by refutation and resolution, try to prove that people like bananas using your KB from (b). For each new clause in your proof, clearly indicate the previous clauses used. If "people like bananas" cannot be proven, then clearly explain or demonstrate why.

d. Using proof by refutation and resolution, try to prove that people like apples using your KB from (b). For each new clause in your proof, clearly indicate the previous clauses used. If "people like apples" cannot be proven, then clearly explain or demonstrate why.

 


Related Discussions:- Convert statement into conjunctive normal form

What are the requirements of the user, This step of systems examination is ...

This step of systems examination is one of the most difficult. In this stage systems specifications are identified by asking what, who, when, where and how. A few questions address

Name the languages introduced in second generation, Name the languages intr...

Name the languages introduced in second  generation During  the time of  second  generation  many  high  level  programming  languages  were introduced, such as FORTRAN (1956),

Explain the working of a 3-bit D/A converter, With the help of R-2R binary ...

With the help of R-2R binary network, explain the working of a 3-bit D/A converter and derive an expression for the output voltage. Ans: We see a 3-bit R-2R ladder D/A netwo

Explain programmer visible registers, Q. Explain Programmer Visible Registe...

Q. Explain Programmer Visible Registers? These registers can be accessed employing machine language. In general we encounter four kinds of programmer visible registers.

Operating system, define request edge and assignment edge

define request edge and assignment edge

What is a snooping cache, DNS cache snooping is not a term the author just ...

DNS cache snooping is not a term the author just made up, it is called and discussed by some notable DNS execution developers, and a few interested DNS administrators have prob

Grapgh, representation of the adjacency matrix and adjacency list

representation of the adjacency matrix and adjacency list

Logical database structure, It is not essential to maintain the Parent-Chil...

It is not essential to maintain the Parent-Child relationship among the tables in Logical Database Structure. False. One has to handle the Parent-Child relationship.

Smallest and largest integer , A given microprocessor has words of 1 byte. ...

A given microprocessor has words of 1 byte.  What is the smallest and largest integer that can be characterized in the following representations?   a) unsigned b) sign- ma

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd