Anna university, Chennai B.E / Engineering Degree Examination CS ARTIFICIAL INTELLIGENCE SIXTH SEMESTER Regulation. SUBJECT CODE: CS SUBJECT NAME: ARTIFICIAL INTELLIGENCE DEPARTMENT: CSE YEAR: 3. SEMESTER: 6. SYLLABUS. CS Artificial Intelligence Lecture Notes.» CS Artificial Intelligence Lecture Notes. Lecture Notes Provided by. Einstein college of Engineering.

Author: Nikotilar Malakus
Country: Namibia
Language: English (Spanish)
Genre: Career
Published (Last): 9 April 2005
Pages: 249
PDF File Size: 13.24 Mb
ePub File Size: 13.79 Mb
ISBN: 699-9-20709-289-7
Downloads: 61128
Price: Free* [*Free Regsitration Required]
Uploader: Nakora

The art of creating machines that perform functions that require intelligence when performed by people. Why does uncertainty arise? Define Interpretation Interpretation specifies exactly which objects, relations and functions are reffered to by the constant cs351, and function symbols.

2008 Anna University Chennai B.E Computer Science CS 1351 ARTIFICIAL INTELLIGENCE Question paper

State the reason why first order, logic fails to cope with that the mind like medical diagnosis. Define an Ideal rational agent. Logical Constants True, False ii.

Depth limited avoids the pitfalls of DFS by imposing a cut off of the maximum depth artificiaal a path. What is truth Preserving An inference algorithm that derives only entailed sentences artiificial called sound or truth preserving.


Episodic Vs Non episodic: Learning by building identification trees.

Single state problem, Multiple state problem, Contingency problem, Exploration problem. The different types of planning are as follows: The use utility theory to represent and reason with preferences.

The components that are needed for representing an action are: The Turing test proposed by Alan Turing was designed to provide a satisfactory operational definition of intelligence. Planning can be viewed as a type of problem solving in which the agent uses beliefs about actions and their consequences to search for a solution.

What are the different types of problem? Click here to sign up.

Different varieties of queuing fn produce different varieties of the search algorithm. What are the different types of planning? Learning by recording cases.


If the successor function is defined to generate all possible applications of inference rules then the search algorithms can be applied to find proofs. Many problems have very deep or even infinite search tree. Define Validity of a sentence A sentence is valid or necessarily true if and only if it is true under all possible interpretation in all posssible world.


When the agent knows about the environment. Conditional planning is a way in which the incompleteness of information is incorporated in terms of adding a conditional step, which involves if — then rules. The action that the agent can perform. Give two iterative improvement algorithms. They can be handled with the help of two planning agents namely, i. List some drawbacks of hill climbing process. Define Semantics The semantics of the language defines the truth of each sentence with respect to each possible world.

A multiple connected graph is one in which two nodes are connected by more than one path. What are called as Poly trees? Ever thing that the agent has perceived so far.

Deterministic Vs Non deterministic: