Knowledge representation in artificial intelligence , Computer Engineering

Assignment Help:

Knowledge Representation:

To recap, now we have some characterizations of Artificial Intelligence, so  when an Artificial Intelligence problem arises, you will enable  to put it into context, search the right techniques and apply them. We have introduced the agent's language so that we may talk about intelligent job and how to carry them out. We have also looked at search in the common case, which is central to AI problem solving. Most pieces of software have to deal with data of some type, and in AI we use the additional grandiose title of "knowledge" to stand  for  data  including 

(i)   procedures, like how to treat a patient with a high temperature

(ii) facts,  like  the  temperature of a patient and

(iii) meaning, likewise why a patient with a high temperature should not be given a hot bath. Accessing and using all these kinds of information will be very important for an intelligent agent to act rationally. For this reason, knowledge representation is our final common consideration before we look at specific problem types.

To a big extent, the way in which you arrange information available to and generated by your intelligent agent will be dictated by the type of problem you are addressing. Regularly,   the best   ways of representing knowledge   for particular techniques are known. But, as with the problem of how to search, you will have to great flexibility in the way you represent information. so, it is worth looking at 4 common  schemes for representing  knowledge, namely frames ,semantic networks, production rules and logic. Knowledge representation continues to be a much-researched topic in AI because of the realization early on that how information is arranged may often make or break an AI application.


Related Discussions:- Knowledge representation in artificial intelligence

Add the equation by using 648 and 487 in bcd code, Add 648 and 487 in BCD c...

Add 648 and 487 in BCD code. Ans. In BCD Code, addition of 648 and 487: 6 4 8  =  0 1 1 0   0 1 0 0      1 0 0 0 4 8 7  =  0 1 0 0   1 0 0 0      0 1 1 1 ---------------------

State and prove any one of the demorgen''s laws, Q. F(x,y,z) = ∑m (4,6,7,8...

Q. F(x,y,z) = ∑m (4,6,7,8)+ ∑d (2,5,11,12) Using K-Map. Q. State and prove any one of the DeMorgen's Laws. Show that these theorems can be extended up to any number of variabl

Programming , Adavantages and disadvantages of compilers and interpreters

Adavantages and disadvantages of compilers and interpreters

Database management system, what is time out based schemes in concurrency c...

what is time out based schemes in concurrency control

Show basic concepts of permutation, Q. Show Basic concepts of permutation? ...

Q. Show Basic concepts of permutation? Let us look at the basic concepts of permutation with respect to interconnection network.  Let us say the network has set of n input node

What is multiple interrupt lines, Q. What is Multiple Interrupt Lines? ...

Q. What is Multiple Interrupt Lines? Multiple Interrupt Lines: Simplest solution to problems above is to provide multiple interrupt lines that will result in immediate recognit

Sap security audit log, You are required to use software of your choice (sp...

You are required to use software of your choice (spreadsheet, database, statistical package etc) to analyze the provided SAP security audit log data ( Userdata.xls ), generate appr

Permanently resident pages - main memory, Permanently resident pages: ...

Permanently resident pages: Every virtual memory systems have memory areas that are "pinned down", for example cannot be swapped out to secondary storage, for instance:

Explain the different types of buses with neat diagram, Explain the differe...

Explain the different types of buses with neat diagram. When a word of data is transferred among units, all the bits are transferred in parallel over a set of lines known as bu

What is a accepting computation history, What is a accepting computation hi...

What is a accepting computation history?  An accepting computation history is explained as , Let M be a Turing machine and w be a input string,  for M on w is a sequence of con

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