What are present in each level of planning graph?

a) Literals

b) Actions

c) Variables

d) Both Literals & Actions

1 Answer

Answer :

d) Both Literals & Actions

Related questions

Description : In Artificial Intelligence (AI), what is present in the planning graph? (1) Sequence of levels (2) Literals (3) Variables (4) Heuristic estimates

Last Answer : Sequence of levels

Description : What is the condition of variables in first-order literals? a) Existentially quantified b) Universally quantified c) Both Existentially & Universally quantified d) None of the mentioned

Last Answer : b) Universally quantified

Description : Where does the degree of belief is applied? a) Propositions b) Literals c) Variables d) Statements

Last Answer : a) Propositions

Description : What kind of clauses are available in Conjunctive Normal Form? a) Disjunction of literals b) Disjunction of variables c) Conjunction of literals d) Conjunction of variables

Last Answer : a) Disjunction of literals

Description : Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan. a) Conditional Plan b) Conformant Planning c) Execution monitoring d) Both Conditional Plan & Execution monitoring

Last Answer : c) Execution monitoring

Description : The process by which the brain orders actions needed to complete a specific task is referred as ____________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Last Answer : d) Both Planning problem & Partial order planning

Description : The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Last Answer : b) Partial order planning

Description : What is the starting level of planning graph? a) Level 3 b) Level 2 c) Level 1 d) Level 0

Last Answer : d) Level 0

Description : How many literals are available in top-down inductive learning methods? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

Description : What is called inconsistent support? a) If two literals are not negation of other b) If two literals are negation of other c) Mutually exclusive d) None of the mentioned

Last Answer : b) If two literals are negation of other

Description : For resolution to apply, all sentences must be in conjunctive normal form, a conjunction of disjunctions of literals. a) True b) False

Last Answer : a) True

Description : What will happen if two literals are identical? a) Remains the same b) Added as three c) Reduced to one d) None of the mentioned

Last Answer : c) Reduced to one

Description : Which form is called as a conjunction of disjunction of literals? a) Conjunctive normal form b) Disjunctive normal form c) Normal form d) All of the mentioned

Last Answer : a) Conjunctive normal form

Description : Two literals are complementary if _____________ a) They are equal b) They are identical and of equal sign c) They are identical but of opposite sign d) They are unequal but of equal sign

Last Answer : c) They are identical but of opposite sign

Description : What are the 3 kinds of literals that can be added?

Last Answer : i. Literals using Predicate  ii. Equality and inequality literals  iii. Arithmetic comparisons

Description : What are the two main subroutines used for generating literals?

Last Answer : i. NEW – LITERALS  ii. CHOOSE - LITERALS

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

Description : When will further expansion is unnecessary for planning graph? a) Identical b) Replicate c) Not identical d) None of the mentioned

Last Answer : a) Identical

Description : Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Last Answer : a) Propositional planning problem

Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Last Answer : b) Graphplan

Description : Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned

Last Answer : c) Planning graph algorithm

Description : A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan

Last Answer : d) Hierarchical plan

Description : A horn clause is ...................... (A) A clause in which no variables occur in the expression (B) A clause that has at least one negative literal (C) A disjunction of a number of literals (D) A clause that has at most one positive literal

Last Answer : (D) A clause that has at most one positive literal 

Description : How the entries in the full joint probability distribution can be calculated? a) Using variables b) Using information c) Both Using variables & information d) None of the mentioned

Last Answer : b) Using information

Description : What are not present in finish actions? a) Preconditions b) Effect c) Finish d) None of the mentioned

Last Answer : b) Effect

Description : What are not present in start actions? a) Preconditions b) Effect c) Finish d) None of the mentioned

Last Answer : a) Preconditions

Description : Which is unique up to renaming of variables? a) Unifier b) Most general unifier c) Unifier & Most general unifier d) None of the mentioned

Last Answer : b) Most general unifier

Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph

Last Answer : b) Travelling Salesman problem

Description : What is meant by persistence actions? a) Allow a literal to remain false b) Allow a literal to remain true c) Allow a literal to remain false & true d) None of the mentioned

Last Answer : b) Allow a literal to remain true

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

Description : What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems

Last Answer : a) Search & Logic

Description : Where does the additional variables are added in HMM? a) Temporal model b) Reality model c) Probability model d) All of the mentioned

Last Answer : a) Temporal model

Description : What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Last Answer : d) Probability distributions for Continuous variables

Description : How many types of random variables are available? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

Description : The primitives in probabilistic reasoning are random variables. a) True b) False

Last Answer : a) True

Description : What is the process of capturing the inference process as a single inference rule? a) Ponens b) Clauses c) Generalized Modus Ponens d) Variables

Last Answer : c) Generalized Modus Ponens

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

Description : Which will be the instance of the class datalog knowledge bases? a) Variables b) No function symbols c) First-order definite clauses d) None of the mentioned

Last Answer : b) No function symbols

Description : Which is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition

Last Answer : c) Propositional resolution

Description : What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Last Answer : d) Probability distributions for Continuous variables

Description : How many types of random variables are available? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

Description : Define runtime variables.

Last Answer : Plans to gather and use information are represented using short hand  Notation called runtime variables (n).  Example  [Look up (Agent, “Phone number (Divya)”.N), Dial (n)]

Description : Is this statement true or falseA system of linear equations is a set of two or more equations with the same variables, and the graph of each equation is a line?

Last Answer : 1

Description : What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Last Answer : b) Linearization

Description : One the main drawback of this type of planning system is that it requires a lot of computational powers at each node. a) True b) False

Last Answer : a) True

Description : A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. a) Decision tree b) Graphs c) Trees d) Neural Networks

Last Answer : a) Decision tree

Description : What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Last Answer : d) Decision tree

Description : Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph

Last Answer : b) Directed graph

Description : For general graph, how one can get rid of repeated states? a) By maintaining a list of visited vertices b) By maintaining a list of traversed edges c) By maintaining a list of non-visited vertices d) By maintaining a list of non-traversed edges

Last Answer : a) By maintaining a list of visited vertices

Description : What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Last Answer : d) Decision tree