InrRopuction To AI anp INTELLIGENT AGENT ee Prob Explain Artificial Intelligence in brief. Sol. According to the father of AL, John McCarthy it is “The science and Engineering of making intelligent machines, especially intelligent computer programs”. Prob2 What is the goal of Artificial Intelligence? Sol.(a) To Create Expert System: It is the type of system in which the system exhibit intelligent behaviour, and advice to its users, (b) To Implement Human Intelligence in Machines: It isa way of creating the systems that understand, think, learn and behave like humans. ProbS What are the.various applications of - Intelligence? tificial Natural Language Processing Expert Systems| Gaming Vision Systems Intelligent Robots, Speech Recognition etc. Probé What are the major categories of AI? Explain them briefly. Why AL is a matter of research ? Prob3 Explain types of Artificial Intelligence. Sol. Strong Artificial Intelligence: It deals with the creation of real intelligence artificially. Also, strong AI believes that machines can be made sentient. ‘Weak Artificial Intelligence: human level intelligence in macl It doesn’t believe creating. sis possible. —_—_—_—_—————————— Probd. ‘What is Constraint Satisfaction Problems? Sol. Constraint Satisfaction Problems (CSPs) are ‘mathematical problems defined as a set of objects, the state of which must meet several constraints. CSPs are useful for Al because the regularity of their formulation offers ‘commonality for analyzing and solving problems. Sol. Artificial Intelligence: AI system has four major categories (1) Knowledge Representation (2)Heuristic Search (3)AI Programming Language and Tools (AAI Hardware (1) The quality of the result depends on how much knowledge the system possesses. The available knowledge must be represented in a very efficient way. Hence, knowledge representation in a vital component ofthe system. 2)lt is not merely enough that knowledge is represented efficiently. The inference process should also be equally good for satisfactory results. The inference process is broadly B->C They also use heu “rules of thumb". Heuristics can be captured using rules like "If the meal includes red ‘meat then choose red.salad dressings". Heuristics represent conventional wisdom. They use past experience, "cases", Particularly evident in precedence-based reasoning e.g. law or choice of accounting principles. Similarity of current case to previous cases provides basis for action choice. Cases are stored using key attributes. Example of attributes can be shown as: cars may be.characterized by: year of car. Prob.16. Discuss comparison between DFS & BFS with various types of contrui sirategies: — [RT.U. 2019, 2014) OR Differentiate the breadth first search and depth first. search in detail, (RTEU.2013] ——— Sol. Control Strategies : Refer to Prob.14. Both BFS and DFS are graph traversal methods but they differ in following manner: Ss. BFS DFS No. (a) | Breadth First Search [Depth First Wearch Works on Works on First in [Last In First Out (LIFO) First Out (FIFO) principal. principal. b) | Ituses queue asa |ituses stack as a data data structure, structure. ©) _| General Idea: [General de: 1, First we examine |. First we examine the Stat node A. [2. Then we examine each node N along a path P which begins at A, that is, we process a neighbour of A, then neighbour of A and so on After coming to the end of the starting node A [2. Then we examine all the neighbours, of A. Then we examine all the neighbour of the neighbours of A, and so on. path P, we backtrack on P until we can continue along another path P’, and so on,(@ [Algorithm [Algorithm 1 Initially, add starting [1 Initially, push starting node (say A) to queue node (say A) onto stack ‘Add A to queue AT visited = (}) defines a solution, then quit and report the solution, 3. If the union of the constraints discovered above defines a contradiction, then return failure. 4, Ifneither of the above occurs, then it is necessary to make a guess at something in order to proceed. + Todo this, loop until a solution is found oral possible solutions have been eliminated: (a) Select an object whose value is not yet determined and select a way of strengthening the constraints on that object. (b). Recursively invoke constraint satisfaction with the current set of constraints augmented by the strengthening constraint just selected. (v), Generate and Test ‘The generate-and-test strategy is the simplest of all the approaches we discuss. It consists of the following steps: Algorithm: Generate and Test 1, Generate a possible solution. For some problems, this means. generating a particular point in the problem space. For others, it means generating a path from a start state. 2. Testto see ifthis is actually a solution by comparing the chosen point or the endpoint of the chosen path to the set of acceptable goal states. 3, Ifa solution has been found, quit. Otherwise, return «to step 1. + If the generation of possible solutions is done systematically, then this procedure will find a solution eventually, ifone exists. Unfortunately, if the problem space is very Jag, “eventually” may be a very longtime. (b) The generate and test algorithm is a depth-first search procedure since complete solutions must be generated before they can be tested, In its most systematic form, itis simply an exhaustive search of the problem space. Generate and test can, of course, also operate by generating solutions randomly, but then there is no guarantee that a solution will ever be found. In this form, itis also known as the British Museum algorithm, a reference to a method for finding an object in the British Museum by wandering randomly. Between these two extremes lies a practical middle ground in which the search process proceeds systematically, but some paths are not considered because they seem unlikely to lead to a solution. This evaluation is performed by a heuristic function. (vi) Means Ends Analysis a A collection of search strategies that can reason either forward or backward, but for a given problem, one direction or the other must be chosen. Often, however, a mixture of the two directions is appropriate. Such a mixed strategy would make it possible to solve the major parts of a problem first and then go back and solve the small probleins that arise in “gluing” the big pieces together. technique known as means- ends analysis allows us to.do that. ‘The means-ends analysis process centers around the detection of differences between the current state and the goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps that operator cannot be applied to the current state. So we set up a subproblem of getting to a state in which it can be applied. The kind of backward chaining in which operators are selected and then subgoals are set up to establish the” preconditions of the operators is called operator subgoaling. But may be the operator does not produce exactly the goal state we want. Then we have a second subproblem of getting” from the state it does produce tothe goal. But ifthe difference was chosen correctly and if the operator is really effective at: reducing the difference, then the two subproblems shouldbe *=) easier to solve than the original problem. Algorithm : Means-Ends Analysis (CURRENT, GOAL) 1. Compare CURRENT to GOAL. If there are no differences between them then return, 2, Otherwise, select the most important difference and reduce it by doing the following until success or failure is signaled: (@) Select an as yet untried operator © that is, applicable to the current difference, If there are no such operators, then signal failure. Attempt to apply © to CURRENT. Generate descriptions of two states: O-START, a state in which 0's preconditions are satisfied and O- )