SUBJECT CODE / Name: CS – ARTIFICIAL INTELLIGENCE. UNIT – II. PART -A (2 Marks). LOGICAL REASONING. 1. What factors determine the selection. Artificial Intelligence CS – Two mark Question Bank 2. Define Artificial Intelligence in terms of human performance. The art of creating machines that. ARTIFICIAL INTELLIGENCE 2 MARKS AND 16 MARKS ANNA UNIVERSITY CSE 7TH SEMESTER ARTIFICIAL INTELLIGENCE 2 MARKS.

Author: Goltishura Bakora
Country: Panama
Language: English (Spanish)
Genre: Photos
Published (Last): 6 June 2013
Pages: 441
PDF File Size: 13.43 Mb
ePub File Size: 3.94 Mb
ISBN: 272-4-18434-197-5
Downloads: 15151
Price: Free* [*Free Regsitration Required]
Uploader: Dourisar

Once a local maxima is reached the algorithm will halt even though the solution may be far from satisfactory. Iterative deepening is a strategy that sidesteps the issue of choosing the best depth limit by trying all possible depth limits: What are called as Poly trees? The action program will run on some sort of computing device which is called as Architecture. Anna University – B.

The art of creating machines that perform functions that require intelligence when performed by people. Syntax of a knowledge describes the possible configurations that artificlal constitute sentences. Define Semantics The semantics of the language defines the truth of each sentence with respect to each possible world.

List the various search strategies.


Write FOIL algorithm for learning sets of first- order horn clauses from example. Draw a learning curve for the decision tree algorithm Define iterative deepening search. What is called as bidirectional search?


Anna University Department of Civil Engineering B. An atomic event is an assignment of particular values to all variables, in other words, the complete specifications of the state of domain. How to request Study Material? What is its role?

November 16, 0. This is known as MEU.

Problem formulation, Search solution, Execution. But programming a computer to pass the test provides plenty to work on, to posses the following capabilities.

How CSP is formulated as a search prob- lem? Whether uniform cost search is optimal? Explain in detail with an example. The process of treating something abstract and difficult to talk about as though it were concrete and easy to talk about is called as reification. List any two NLP systems.

CS6659 AI Notes, Artificial Intelligence Lecture Notes – CSE 6th SEM Anna University

Define a well-formed formula wff. The exciting new effort to make computers think machines with minds in the intwlligence and literal sense. Define Artificial Intelligence in terms of rational acting. What are the phases involved in designing a problem solving agent? Probability provides cd2351 way of summarizing the uncertainty that comes from our laziness and ignorance.

If i can derive?? Define forward and backward chaining. The planner should be able to use Divide and Conquer method for solving very big problems.

Proof Theory — a set of rules for deducing the entailment of set sentences. What is the role of semantic analysis in NLP? What is meant by belief network? They can be handled with the help of two planning agents namely, Conditional planning agent. What inteloigence the principles that are followed by any learning procedure? What is fuzzy logic? Learning by training neural networks.


State the reason why first order, logic fails to cope with that the mind like medical diagnosis. How do they differ from semantic nets. Finding proof is exactly finding solution to search problems. What are Intelligent Agents? These is for the Anna University syllabus – regulation The algorithm that works only on singly connected networks known as Poly trees.

Artificial Intelligence CS – Two mark Question Bank | Knowledge Adda

Define a complete plan. Mention the criteria for the evaluation of search strategy. What is a Production System? Explain different agent types with their PEAS descriptions.

Explain with examples a V erb sub categorization 8 b S emantic interpretation 8 6 D i scuss ambiguity and disambiguation. When enough memory is available for entire search tree, the search is optimally efficient. Mention the strategies used in resolving clauses unit-preference, set-of-support, best first.