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

Define variants of turing machine, Define variants of Turing Machine?  ...

Define variants of Turing Machine?  Variants are  Non deterministic turing machine.  Mutlitape turing  machine.  Enumerators

What is a formal description for a programming language, A grammar for a pr...

A grammar for a programming language is a formal description of ? Structure is a formal description for a programming language.

What are the registers generally contained in the processor, What are the r...

What are the registers generally contained in the processor? MAR-memory address register MDR-memory data register IR-Instruction Register RO-Rn-General purpose registe

The color and plot style, Write a script that will make x and y vectors.  T...

Write a script that will make x and y vectors.  Then, it will ask the user for a color ('red', 'blue', or 'green') and for a plot style ('o', '*').  It will then make a string "pst

Illustration of disk formatting, Q. Illustration of disk formatting? An...

Q. Illustration of disk formatting? An illustration of disk formatting is displayed in Figure below. In this case every track comprises 30 fixed-length sectors of 600 bytes eac

Determine the nand gate, Find out the two inputs when the NAND gate output ...

Find out the two inputs when the NAND gate output will be low. Ans. The output of NAND gate will be low if the two inputs are 11. The Truth Table of NAND gate is shown

What is memory mapped i/o, What is memory mapped I/O? When the I/O devi...

What is memory mapped I/O? When the I/O devices share the similar address space, the arrangement is known as memory mapped I/O.

What is tape backup, Q. What is Tape Backup? Magnetic tapes are used th...

Q. What is Tape Backup? Magnetic tapes are used these days in computers for the below purposes: Backing up data stored in disks. It is essential to regularly save data s

Properties of e-cash, Properties: 1.  Monetary Value: Monetary value mu...

Properties: 1.  Monetary Value: Monetary value must be backed by either cash, bank - authorized credit cards or bank certified cashier's cheque. 2.  Interoperability: E-cash

A sorting algorithm is stable, A sorting algorithm is stable if  Preser...

A sorting algorithm is stable if  Preserves the original order of records with equivalent keys.

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