Artificial Intelligence — Winter 2023

Discuss the various application areas for artificial intelligence.

Explain state space search representation using the water-jug problem.

Explain any two heuristic functions for an 8-tile puzzle problem with an appropriate example.

Explain the advantages of first-order predicate logic over propositional logic with an appropriate example.

Explain the means-ends analysis with an appropriate example.

Explain the best-first search algorithm using an appropriate example.

Explain the A* search algorithm using an appropriate example.

Discuss the Wampus World problem in brief.

Explain the universal and existential quantifiers with an appropriate example.

Explain Modes Ponens and Modes Tollens inference rules with an appropriate example.

Discuss various logical connectives in propositional logic.

Explain the backward search procedure with an example.

Explain the use of resolution in first order predicate logic using an appropriate example.

Explain the concepts of tautology and contradiction in propositional logic with an appropriate example.

Explain the expectation–maximization (EM) algorithm with an appropriate example.

Explain inference in Bayesian networks using an appropriate example.

Explain the concept of unification in first order predicate logic with an appropriate example.

Explain inference using full joint distribution in uncertainty using an appropriate example.

Explain the alpha-beta pruning algorithm in game-playing using an appropriate example.

Explain unconditional and conditional probability with appropriate examples.

Write a program in prolog to find the Fibonacci series up to the given number.

Explain the fail and cut predicate in prolog programming with an example.

Explain the MiniMax procedure in a two-player game with an appropriate example.

Write a program in prolog to find a length of a list.

Write a program in prolog to find the GCD (greatest common divisor) and LCM (least common multiple) of two numbers.