What among the following could the universal instantiation of ___________ For all x King(x) ^ Greedy(x) => Evil(x) a) King(John) ^ Greedy(John) => Evil(John) b) King(y) ^ Greedy(y) => Evil(y) c) King(Richard) ^ Greedy(Richard) => Evil(Richard) d) All of the mentioned

What among the following could the universal instantiation of ___________ For all x King(x) ^ Greedy(x) => Evil(x) a) King(John) ^ Greedy(John) => Evil(John) b) King(y) ^ Greedy(y) => Evil(y) c) King(Richard) ^ Greedy(Richard) => Evil(Richard) d) All of the mentioned
by

1 Answer

Answer :

d) All of the mentioned
by

Related questions

Which among the following could the Existential instantiation of ∃x Crown(x) ^ OnHead(x, Johnny)? a) Crown(John) ^ OnHead(John, Jonny) b) Crown(y) ^ OnHead(y, y, x) c) Crown(x) ^ OnHead(x, Jonny) d) None of the mentioned

Description : Which among the following could the Existential instantiation of ∃x Crown(x) ^ OnHead(x, Johnny)? a) Crown(John) ^ OnHead(John, Jonny) b) Crown(y) ^ OnHead(y, y, x) c) Crown(x) ^ OnHead(x, Jonny) d) None of the mentioned

Last Answer : a) Crown(John) ^ OnHead(John, Jonny)

Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Last Answer : d) All of the mentioned

Lifted inference rules require finding substitutions that make different logical expressions looks identical. a) Existential Instantiation b) Universal Instantiation c) Unification d) Modus Ponen

Description : Lifted inference rules require finding substitutions that make different logical expressions looks identical. a) Existential Instantiation b) Universal Instantiation c) Unification d) Modus Ponen

Last Answer : c) Unification

The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by substituting a ground term (a term without variables) for the variable. a) True b) False

Description : The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by substituting a ground term (a term without variables) for the variable. a) True b) False

Last Answer : a) True

Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost

Description : Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost

Last Answer : c) The one closest to the goal node

__________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned

Description : __________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned

Last Answer : b) SatPlan

Which search method will expand the node that is closest to the goal? a) Best-first search b) Greedy best-first search c) A* search d) None of the mentioned

Description : Which search method will expand the node that is closest to the goal? a) Best-first search b) Greedy best-first search c) A* search d) None of the mentioned

Last Answer : b) Greedy best-first search

Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Description : Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Best-first search

The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicated. For any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base. a) True b) False

Description : The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicated. For any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base. a) True b) False

Last Answer : a) True

_____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Description : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Last Answer : c) Graph-Plan

General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Last Answer : d) MIN/MAX Algorithms

Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

Description : Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

Last Answer : c) Greedy local search

What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Description : What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Last Answer : a) Heuristic function

What is the meaning for greedy local search?

Description : What is the meaning for greedy local search?

Last Answer :  It goals (picks) a good neighbor state without thinking ahead about where to go next. 

Define Greedy Best First Search.

Description : Define Greedy Best First Search.

Last Answer : It expands the node that is closest to the goal (i.e.) to reach solution in a quicker way. It is done by using the heuristic function: f(n) = h(n).

In AI programming, a list may contain ___________ a) cells b) fields c) pointers d) all of the mentioned

Description : In AI programming, a list may contain ___________ a) cells b) fields c) pointers d) all of the mentioned

Last Answer : d) all of the mentioned

A KES knowledge base contains information in the form of ___________ a) associations b) actions c) free text d) all of the mentioned

Description : A KES knowledge base contains information in the form of ___________ a) associations b) actions c) free text d) all of the mentioned

Last Answer : d) all of the mentioned

Parts-of-Speech tagging determines ___________ a) part-of-speech for each word dynamically as per meaning of the sentence b) part-of-speech for each word dynamically as per sentence structure c) all part-of-speech for a specific word given as input d) all of the mentioned

Description : Parts-of-Speech tagging determines ___________ a) part-of-speech for each word dynamically as per meaning of the sentence b) part-of-speech for each word dynamically as per sentence structure c) all part-of-speech for a specific word given as input d) all of the mentioned

Last Answer : d) all of the mentioned

Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned

Description : Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned

Last Answer : d) All of the mentioned

MCC is investigating the improvement of the relationship between people and computers through a technology called ___________ a) computer-aided design b) human factors c) parallel processing d) all of the mentioned

Description : MCC is investigating the improvement of the relationship between people and computers through a technology called ___________ a) computer-aided design b) human factors c) parallel processing d) all of the mentioned

Last Answer : b) human factors

First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Description : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Last Answer : d) All of the mentioned

A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned

Description : A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned

Last Answer : d) All of the mentioned

Optimality of BFS is ___________ a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) None of the mentioned

Description : Optimality of BFS is ___________ a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) None of the mentioned

Last Answer : b) When all step costs are equal

The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Description : The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Last Answer : c) Successor function, which takes current action and returns next immediate state

In LISP, the atom that stands for “False” is ___________ a) t b) nil c) y d) time

Description : In LISP, the atom that stands for “False” is ___________ a) t b) nil c) y d) time

Last Answer : b) nil

Which of the American presidents called the former Soviet Union “An Evil Empire”? (a) Richard Nixon (b) Jimmy Carter (c) Ronald Reagan (d) George Herbert Walker Bush

Description : Which of the American presidents called the former Soviet Union “An Evil Empire”? (a) Richard Nixon (b) Jimmy Carter (c) Ronald Reagan (d) George Herbert Walker Bush

Last Answer : (c) Ronald Reagan

Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Description : Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Last Answer : a) Pruned leaves x and y

Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned

Description : Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned

Last Answer : b) Ockham razor

What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned

Description : What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned

Last Answer : d) All of the mentioned

What among the following is/are the example of the intelligent agent/agents? a) Human b) Robot c) Autonomous Spacecraft d) All of the mentioned

Description : What among the following is/are the example of the intelligent agent/agents? a) Human b) Robot c) Autonomous Spacecraft d) All of the mentioned

Last Answer : d) All of the mentioned

Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned

Description : Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned

Last Answer : b) Ockham razor

If the English Philosopher Thomas Hobbes could be called ‘grandfather’ of artificial intelligence, then who could be called its father? a) A.M. Turning b) John McCarthy c) Allen Newell d) Herbert Simon

Description : If the English Philosopher Thomas Hobbes could be called ‘grandfather’ of artificial intelligence, then who could be called its father? a) A.M. Turning b) John McCarthy c) Allen Newell d) Herbert Simon

Last Answer : a) A.M. Turning

There exist only two types of quantifiers, Universal Quantification and Existential Quantification. a) True b) False

Description : There exist only two types of quantifiers, Universal Quantification and Existential Quantification. a) True b) False

Last Answer : a) True

extendible architecture is A. Modular design of a software application that facilitates the integration of new modules B. Showing a universal law or rule to be invalid by providing a counter example C. A set of attributes in a database table that refers to data in another table D. None of these

Description : extendible architecture is A. Modular design of a software application that facilitates the integration of new modules B. Showing a universal law or rule to be invalid by providing a counter example C. ... of attributes in a database table that refers to data in another table D. None of these

Last Answer : A. Modular design of a software application that facilitates the integration of new modules

Falsification is A. Modular design of a software application that facilitates the integration of new modules B. Showing a universal law or rule to be invalid by providing a counter example C. A set of attributes in a database table that refers to data in another table D. None of these

Description : Falsification is A. Modular design of a software application that facilitates the integration of new modules B. Showing a universal law or rule to be invalid by providing a counter example C. A set of attributes in a database table that refers to data in another table D. None of these

Last Answer : B. Showing a universal law or rule to be invalid by providing a counter example

Difference between object instantiation and construction ?

Description : Difference between object instantiation and construction ?

Last Answer : Ans. Though It's often confused with each other, Object Creation ( Instantiation ) and Initialization ( Construction ) are different things in Java. Construction follows object creation. Object ... provides one default implementation to set the default values according to the member data types.

An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions

Description : An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions

Last Answer : b) It is guaranteed to return an optimal solution when one exists

The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________ a) O(n) b) O(n2) c) O(n!) d) O(n/2)

Description : The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________ a) O(n) b) O(n2) c) O(n!) d) O(n/2)

Last Answer : c) O(n!)

The area of AI that investigates methods of facilitating communication between people and computers is ___________ a) natural language processing b) symbolic processing c) decision support d) robotics

Description : The area of AI that investigates methods of facilitating communication between people and computers is ___________ a) natural language processing b) symbolic processing c) decision support d) robotics

Last Answer : a) natural language processing

The expert system developed at MIT to solve mathematical problems is known as ___________ a) RAND b) ISIS c) MACSYMA d) MOLGEN

Description : The expert system developed at MIT to solve mathematical problems is known as ___________ a) RAND b) ISIS c) MACSYMA d) MOLGEN

Last Answer : c) MACSYMA

Seymour Papert of the MIT AI lab created a programming environment for children called ___________ a) BASIC b) LOGO c) MYCIN d) FORTRAN

Description : Seymour Papert of the MIT AI lab created a programming environment for children called ___________ a) BASIC b) LOGO c) MYCIN d) FORTRAN

Last Answer : b) LOGO

In his landmark book Cybernetics, Norbert Wiener suggested a way of modeling scientific phenomena using not energy, but ___________ a) mathematics b) intelligence c) information d) history

Description : In his landmark book Cybernetics, Norbert Wiener suggested a way of modeling scientific phenomena using not energy, but ___________ a) mathematics b) intelligence c) information d) history

Last Answer : c) information

In LISP, the function returns t if <integer> is even and nil otherwise ___________ a) (evenp <integer>) b) (even <integer>) c) (numeven <integer>) d) (numnevenp <integer>)

Description : In LISP, the function returns t if is even and nil otherwise ___________ a) (evenp ) b) (even ) c) (numeven ) d) (numnevenp )

Last Answer : a) (evenp )

Fuzzy logic is usually represented as ___________ a) IF-THEN-ELSE rules b) IF-THEN rules c) Both IF-THEN-ELSE rules & IF-THEN rules

Description : Fuzzy logic is usually represented as ___________ a) IF-THEN-ELSE rules b) IF-THEN rules c) Both IF-THEN-ELSE rules & IF-THEN rules

Last Answer : b) IF-THEN rules

The values of the set membership is represented by ___________ a) Discrete Set b) Degree of truth c) Probabilities d) Both Degree of truth & Probabilities

Description : The values of the set membership is represented by ___________ a) Discrete Set b) Degree of truth c) Probabilities d) Both Degree of truth & Probabilities

Last Answer : b) Degree of truth

A constructive approach in which no commitment is made unless it is necessary to do so is ___________ a) Least commitment approach b) Most commitment approach

Description : A constructive approach in which no commitment is made unless it is necessary to do so is ___________ a) Least commitment approach b) Most commitment approach

Last Answer : a) Least commitment approach

If a hypothesis says it should be positive, but in fact it is negative, we call it ___________ a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis

Description : If a hypothesis says it should be positive, but in fact it is negative, we call it ___________ a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis

Last Answer : c) A false positive hypothesis

A Hybrid Bayesian network contains ___________ a) Both discrete and continuous variables b) Only Discrete variables c) Only Discontinuous variable

Description : A Hybrid Bayesian network contains ___________ a) Both discrete and continuous variables b) Only Discrete variables c) Only Discontinuous variable

Last Answer : a) Both discrete and continuous variables

Uncertainty arises in the wumpus world because the agent’s sensors give only ___________ a) Full & Global information b) Partial & Global Information c) Partial & local Information d) Full & local information

Description : Uncertainty arises in the wumpus world because the agent’s sensors give only ___________ a) Full & Global information b) Partial & Global Information c) Partial & local Information d) Full & local information

Last Answer : c) Partial & local Information

Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Description : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Last Answer : a) Deterministic