Knowledge Representations

Which AI technique enables the computers to understand the associations and relationships between objects and events?

• Heuristic Processing

• Cognitive Science Relative Symbolism Pattern Matching

• Relative Symbolism

• Pattern Matching

The name of the following argument form is... p → q ~ p ∴ ~ q

• Denying the consequent

• Disjunctive Syllogism

• Modus Tollens

• Denying the antecedent.

The search algorithm which is similar to the minimax search, but removes the branches that don't affect the final output is known as__.

• Depth-first search

• Breadth-first search

• Alpha-beta pruning

• None of the above

Which of the following option is used to build complex sentences in knowledge representation?

• Symbols

• Connectives

• Quantifier

• None of the above

In which search problem, to find the shortest path, each city must be visited once only?

• Map coloring Problem

• Depth-first search traversal on a given map represented as a graph

• Finding the shortest path between a source and a destination

• Travelling Salesman problem

In the TSP problem of n cities, the time taken for traversing all cities, without having prior knowledge of the length of the minimum tour will be_______.

• O(n)

• O(n2)

• O(n!)

• O(n/2)

In artificial Intelligence, knowledge can be represented as_______.

• 1. Predicate Logic

• 2. Propositional Logic

• Only II

• Only I

• Both I and II