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.
|Published (Last):||21 May 2015|
|PDF File Size:||18.95 Mb|
|ePub File Size:||11.17 Mb|
|Price:||Free* [*Free Regsitration Required]|
CS1351 Artificial Intelligence Lecture Notes
Once a local maxima is reached the algorithm will halt even though the solution may be far from satisfactory. A problem is really a collection of information that the agent will use to artiifcial what to do. An alternative to dualism is materialism, which holds that the entire world operate according to physical law.
What is the need for probability theory in uncertainty? A set of plans steps. What is called as bidirectional search? Logical Constants True, False ii. List the basic elements that are to be include in problem definition.
Log In Sign Up. Finding proof is exactly finding solution to search problems. So dfs will never be able to recover from an unlucky choice at one of the nodes near the top of the tree. Syntax of a knowledge describes the possible configurations that can constitute sentences. Probability statements do not have quite the same kind of semantics known as evidences.
Define AND —Elimination rule in propositional logic AND elimination rule states that from adtificial given conjunction it is possible to inference any of the conjuncts. The planner should be able to represent the states, goals and actions.
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.
The planner should be able intwlligence add new actions at any time. This type of notations simplifies many equations. List the various type of agent program. What are the components that are needed for representing an action? What is the basic task of a probabilistic inference?
The planner should be able to use Divide and Conquer method for solving very big problems. What is called as principle of maximum expected utility?
Iterative deepening search f. To use the stored information to answer questions and to draw new conclusion.
The study of the computations that make it possible to perceive, reason and act-Winston. Similarity net is a representation in which nodes denotes models, links connect similar models and links are tied to different descriptions.
2008 Anna University Chennai B.E Computer Science CS 1351 ARTIFICIAL INTELLIGENCE Question paper
Define a Complete inference procedure An inference procedure is complete if it can derive all true conditions from a set of premises. Similarity net is an approach for arranging models. Depth limited avoids the pitfalls of DFS by imposing a cut off of the maximum depth of a path. The search will conduct a random walk. Heuristic search-knowledge given Problem specification solution is best.
The algorithm that works only on singly connected networks known as Poly trees.
CS ARTIFICIAL INTELLIGENCE Question Bank – Kings Edition.
The use utility theory to represent and reason with preferences. 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.
What are the different types of planning? Define AI The capability of intelligencf device to perform functions that are normally associated with human intelligence, such as reasoning and optimization through experience.