The planner should be able to use Divide and Conquer method for solving very big problems. Define CSP A constraint satisfaction problem is a special kind of problem satisfies some additional structural properties beyond the basic requirements for problem in general.

Define OR-Introduction rule in propositional logic OR-Introduction rule states that from, a sentence, we can infer its disjunction with anything. What is Explanation Based Learning? This cut-off can be implemented by special depth limited search algorithm or by using the general search algorithm with operators that keep track of the depth. artificiak

Depth limited avoids the pitfalls of DFS by imposing a cut off of the maximum depth of a path. What are the different types of planning? But programming a computer to pass the test provides plenty to work on, to posses the following capabilities. What is fuzzy logic?

‘+relatedpoststitle+’

Please feel free to share you feedback and comments so that i can improve this blog. Depth limited search e. What are Expert Systems? What is Induction heuristics? 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.

What is truth Preserving An inference algorithm that derives only entailed sentences is called sound or truth preserving. The Turing Test approach: Mention the criteria for the evaluation of search strategy. The use utility theory to represent and reason with preferences. What is heuristic search?

Explain with the diagram the upper ontology of the world. Conditional planning is intelligene way in which the incompleteness of information is incorporated in terms of adding a conditional step, which involves if — then rules. List the basic elements that are to be include in problem definition. Syntax of a knowledge describes the possible configurations that can constitute sentences.

List the fields that form the basis for AI.

CS – Artificial Intelligence 2Marks with Answer and 16Marks Questions

Define a Complete inference procedure An inference procedure is complete if it can derive all true conditions from a set of premises. Anna University of Technology – Chennai – 3rd Seme The Turing test proposed by Alan Turing was designed to provide a satisfactory operational definition of intelligence. What is reified link?

What is the need for probability theory in uncertainty? Proof Theory intellugence a set of rules for deducing the entailment of set sentences.

Artificial Intelligence CS2351 – Two mark Question Bank

What are modus ponens? The three phases are: Newer Post Older Post Home. A plateaux is an area of the state space where the evaluation fn is essentially flat.

Define a Proof A sequence of application of inference xrtificial is called a proof. Briefly explain the knowledge acquistion process. So dfs will never be able to recover from an unlucky choice at one of the nodes near the top of the tree.